Sciweavers

572 search results - page 70 / 115
» Exponential-Time Approximation of Hard Problems
Sort
View
PODS
2004
ACM
98views Database» more  PODS 2004»
15 years 10 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
IGARSS
2009
14 years 7 months ago
Unmixing Sparse Hyperspectral Mixtures
Finding an accurate sparse approximation of a spectral vector described by a linear model, when there is available a library of possible constituent signals (called endmembers or ...
Marian-Daniel Iordache, José M. Bioucas-Dia...
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 16 days ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
15 years 10 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
WISEC
2009
ACM
15 years 4 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...