3993 search results - page 286 / 799 » Matchmaking for Structured Objects |
158
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
128
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
The requirements for a system are often specified as textual use cases. Although they are written in natural language, the simple and uniform sentence structure used makes automate...
231
click to vote
DAI
1998
Springer
15 years 8 months ago
1998
Springer
A physically based system of interacting polyhedral objects is used to model self-assembly and spontaneous organization of complex structures. The surfaces of the polyhedra in the ...
113
click to vote
NIPS
2003
15 years 5 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
166
Voted
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...