Sciweavers

9849 search results - page 1757 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
16 years 6 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 6 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 6 months ago
Query Optimization In Compressed Database Systems
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
Zhiyuan Chen, Johannes Gehrke, Flip Korn
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
16 years 3 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
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
16 years 3 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
« Prev « First page 1757 / 1970 Last » Next »