Sciweavers

4836 search results - page 885 / 968
» Exploring the Similarity Space
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
12 years 17 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
ISCA
2012
IEEE
243views Hardware» more  ISCA 2012»
12 years 17 days ago
Lane decoupling for improving the timing-error resiliency of wide-SIMD architectures
A significant portion of the energy dissipated in modern integrated circuits is consumed by the overhead associated with timing guardbands that ensure reliable execution. Timing ...
Evgeni Krimer, Patrick Chiang, Mattan Erez
TKDE
2012
194views Formal Methods» more  TKDE 2012»
12 years 16 days ago
A Query Formulation Language for the Data Web
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...
Mustafa Jarrar, Marios D. Dikaiakos
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 10 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
SIAMMA
2011
97views more  SIAMMA 2011»
13 years 29 days ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...