Sciweavers

415 search results - page 58 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 7 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 7 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
PVLDB
2010
139views more  PVLDB 2010»
13 years 2 months ago
Identifying the Most Influential Data Objects with Reverse Top-k Queries
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
VLDB
2004
ACM
227views Database» more  VLDB 2004»
14 years 21 days ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 9 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof