Sciweavers

10414 search results - page 1896 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
SIGMOD
2009
ACM
125views Database» more  SIGMOD 2009»
16 years 3 months ago
Top-k queries on uncertain data: on score distribution and typical answers
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
Tingjian Ge, Stanley B. Zdonik, Samuel Madden
229
Voted
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 3 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
202
Voted
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 3 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 3 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, ...
230
Voted
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 3 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
« Prev « First page 1896 / 2083 Last » Next »