Sciweavers

3267 search results - page 566 / 654
» Generalized quasirandom graphs
Sort
View
COMPGEOM
2008
ACM
15 years 6 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
CONCUR
2008
Springer
15 years 6 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
CP
2008
Springer
15 years 6 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
DAGM
2008
Springer
15 years 6 months ago
A Multiple Kernel Learning Approach to Joint Multi-class Object Detection
Most current methods for multi-class object classification and localization work as independent 1-vs-rest classifiers. They decide whether and where an object is visible in an imag...
Christoph H. Lampert, Matthew B. Blaschko
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 6 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz