Sciweavers

5244 search results - page 814 / 1049
» Structural Complexity of AvgBPP
Sort
View
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
15 years 10 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
204
Voted
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 10 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
POPL
1989
ACM
15 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
ACCV
2009
Springer
15 years 10 months ago
People Tracking and Segmentation Using Efficient Shape Sequences Matching
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
Junqiu Wang, Yasushi Yagi, Yasushi Makihara
AFRIGRAPH
2007
ACM
15 years 10 months ago
Generic computation of bulletin boards into geometric kernels
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
Mehdi Baba-ali, David Marcheix, Xavier Skapin, Yve...