88 search results - page 5 / 18 » Approximate Range Searching Using Binary Space Partitions |
VLSID
2005
IEEE
14 years 1 months ago
2005
IEEE
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
VRST
1997
ACM
13 years 11 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
IJCAI
2001
13 years 8 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...