2907 search results - page 175 / 582 » Presentations of Structures in Admissible Sets |
177
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
161
click to vote
ICRA
2006
IEEE
16 years 16 days ago
2006
IEEE
— We describe a system in which autonomous robots assemble two-dimensional structures out of square building blocks. A fixed set of local control rules is sufficient for a grou...
165
click to vote
DOOD
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. Semistructured data has no absolute schema xed in advance and its structure may be irregular or incomplete. Such data commonly arises in sources that do not impose a rigi...
154
click to vote
ALENEX
2003
15 years 8 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
183
click to vote
VMV
2001
15 years 7 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...