Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Jason Y. Zien

Papers on DiSC'04


Efficient query evaluation using a two-level retrieval process

Publications


Note: Links lead to the DBLP on the Web.

Jason Y. Zien

Andrei Z. Broder , David Carmel , Michael Herscovici , Aya Soffer , Jason Y. Zien: Efficient query evaluation using a two-level retrieval process. CIKM 2003 : 426-434

Stephen Dill , Nadav Eiron , David Gibson , Daniel Gruhl , R. Guha , Anant Jhingran , Tapas Kanungo , Sridhar Rajagopalan , Andrew Tomkins , John A. Tomlin , Jason Y. Zien: SemTag and seeker: bootstrapping the semantic web via automated semantic annotation. WWW 2003 : 178-186

Tapas Kanungo , Jason Y. Zien: Integrating Link Structure and Content Information for Ranking Web Documents. TREC 2001

Jason Y. Zien, Joerg Meyer , John A. Tomlin , Joy Liu : Web Query Characteristics and their Implications on Search Engines. WWW Posters 2001

Jason Y. Zien, Pak K. Chan , Martine D. F. Schlag : Hybrid spectral/iterative partitioning. ICCAD 1997 : 436-440

Jason Y. Zien, Martine D. F. Schlag , Pak K. Chan : Multi-level spectral hypergraph partitioning with arbitrary vertex sizes. ICCAD 1996 : 201-204

Pak K. Chan , Martine D. F. Schlag , Jason Y. Zien: Spectral-Based Multi-Way FPGA Partitioning. FPGA 1995 : 133-139

Pak K. Chan , Martine D. F. Schlag , Jason Y. Zien: On Routability Prediction for Field-Programmable Gate Arrays. DAC 1993 : 326-330

Pak K. Chan , Martine D. F. Schlag , Jason Y. Zien: Spectral K -Way Ratio-Cut Partitioning and Clustering. DAC 1993 : 749-754

1 [ 9 ]

2 [ 9 ]

3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ]

4 [ 8 ]

5 [ 8 ]

6 [ 8 ]

7 [ 8 ]

8 [ 8 ]

9 [ 9 ]

10 [ 8 ]

11 [ 7 ] [ 8 ]

12 [ 6 ]

13 [ 6 ]

14 [ 8 ]

15 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ]

16 [ 9 ]

17 [ 8 ]

18 [ 6 ] [ 8 ]




©2004 Association for Computing Machinery