Sciweavers

3341 search results - page 58 / 669
» On Bounded Queries and Approximation
Sort
View
143
Voted
KR
1992
Springer
15 years 7 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
169
Voted
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
15 years 8 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
134
Voted
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 10 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
129
Voted
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
15 years 8 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng
122
Voted
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Approximate Colored Range Queries
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Ying Kit Lai, Chung Keung Poon, Benyun Shi