Sciweavers

1536 search results - page 75 / 308
» Approximately Dominating Representatives
Sort
View
WWW
2009
ACM
16 years 5 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
FOCS
2003
IEEE
15 years 9 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
ECCV
2010
Springer
15 years 9 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
HAPTICS
2008
IEEE
15 years 5 months ago
Haptic Interaction with Soft Tissues Based on State-Space Approximation
The well known property of haptic interaction is the high refresh rate of the haptic loop that is necessary for the stability of the interaction. Therefore, only simple computation...
Igor Peterlík, Ludek Matyska
PVLDB
2008
100views more  PVLDB 2008»
15 years 3 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....