Sciweavers

19 search results - page 1 / 4
» On applications of parameterized hyperplane partitioning
Sort
View
SISAP
2010
IEEE
149views Data Mining» more  SISAP 2010»
13 years 3 months ago
On applications of parameterized hyperplane partitioning
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
Jakub Lokoc, Tomás Skopal
DCG
2006
82views more  DCG 2006»
13 years 5 months ago
Volume Computation for Polytopes and Partition Functions for Classical Root Systems
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we prese...
M. Welleda Baldoni-Silva, Matthias Beck, Charles C...
IPL
2006
109views more  IPL 2006»
13 years 5 months ago
The number of guillotine partitions in d dimensions
Guillotine partitions play an important role in many research areas and application domains, e.g., computational geometry, computer graphics, integrated circuit layout, and solid ...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan R...
ICPADS
1998
IEEE
13 years 9 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
PODS
2001
ACM
120views Database» more  PODS 2001»
14 years 5 months ago
Database-friendly random projections
A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space -- where k is lo...
Dimitris Achlioptas