Sciweavers

3341 search results - page 542 / 669
» On Bounded Queries and Approximation
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 2 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
PVLDB
2008
128views more  PVLDB 2008»
14 years 9 months ago
Hexastore: sextuple indexing for semantic web data management
Despite the intense interest towards realizing the Semantic Web vision, most existing RDF data management schemes are constrained in terms of efficiency and scalability. Still, th...
Cathrin Weiss, Panagiotis Karras, Abraham Bernstei...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 12 days ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 11 days ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
CIVR
2007
Springer
273views Image Analysis» more  CIVR 2007»
15 years 4 months ago
Scalable near identical image and shot detection
This paper proposes and compares two novel schemes for near duplicate image and video-shot detection. The first approach is based on global hierarchical colour histograms, using ...
Ondrej Chum, James Philbin, Michael Isard, Andrew ...