Sciweavers

379 search results - page 64 / 76
» Advantages of two new approaches for scientific e-publishing
Sort
View
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 7 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
EDBT
2004
ACM
268views Database» more  EDBT 2004»
14 years 7 months ago
DBDC: Density Based Distributed Clustering
Abstract. Clustering has become an increasingly important task in modern application domains such as marketing and purchasing assistance, multimedia, molecular biology as well as m...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
14 years 5 months ago
Ranking with Query-Dependent Loss for Web Search
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
Jiang Bian, Tie-Yan Liu, Tao Qin, Hongyuan Zha
ANCS
2005
ACM
14 years 1 months ago
Resource mapping and scheduling for heterogeneous network processor systems
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinh...
ICPP
1998
IEEE
13 years 12 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao