Sciweavers

1973 search results - page 97 / 395
» The Construction of Ludic Space
Sort
View
JEA
2008
112views more  JEA 2008»
15 years 6 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
CADE
2002
Springer
16 years 6 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg
DCC
2004
IEEE
16 years 5 months ago
Symplectic Spreads
We construct an infinite family of symplectic spreads in spaces of odd rank and characteristic.
Simeon Ball, John Bamberg, Michel Lavrauw, Tim Pen...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
16 years 26 days ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
EJC
2007
15 years 6 months ago
Euler characteristics and chromatic polynomials
Given a graph we show how to construct a family of manifolds whose Euler characteristics are the values of the chromatic polynomial of the graph at various integers. The manifolds...
Michael Eastwood, Stephen Huggett