Sciweavers

3341 search results - page 227 / 669
» On Bounded Queries and Approximation
Sort
View
DAM
2007
84views more  DAM 2007»
15 years 6 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ECAI
2004
Springer
16 years 14 hour ago
Querying the Semantic Web with Corese Search Engine
This paper presents an ontology-based approach for web querying, using semantic metadata. We propose a query language based on ontologies and emphasize its ability to express appro...
Olivier Corby, Rose Dieng-Kuntz, Catherine Faron-Z...
FOCS
2006
IEEE
16 years 20 days ago
Lower Bounds for Additive Spanners, Emulators, and More
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
David P. Woodruff
FOCS
2006
IEEE
16 years 20 days ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...