Sciweavers

2880 search results - page 66 / 576
» Approximate Range Searching
Sort
View
SIGMOD
2006
ACM
125views Database» more  SIGMOD 2006»
16 years 3 months ago
A non-linear dimensionality-reduction technique for fast similarity search in large databases
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
Khanh Vu, Kien A. Hua, Hao Cheng, Sheau-Dong Lang
RSFDGRC
2005
Springer
126views Data Mining» more  RSFDGRC 2005»
15 years 8 months ago
Rough Sets and Higher Order Vagueness
Abstract. We present a rough set approach to vague concept approximation within the adaptive learning framework. In particular, the role of extensions of approximation spaces in se...
Andrzej Skowron, Roman W. Swiniarski
AIPS
2008
15 years 5 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
CP
2008
Springer
15 years 5 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
ICPR
2008
IEEE
15 years 9 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov