Sciweavers

10412 search results - page 1896 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 4 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
16 years 4 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 4 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
262
Voted
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
16 years 4 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 4 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
« Prev « First page 1896 / 2083 Last » Next »