Sciweavers

7259 search results - page 1216 / 1452
» From Fields to Trees
Sort
View
SIGMOD
1996
ACM
84views Database» more  SIGMOD 1996»
15 years 11 months ago
Change Detection in Hierarchically Structured Information
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...
ICCAD
1994
IEEE
114views Hardware» more  ICCAD 1994»
15 years 10 months ago
Performance-driven synthesis of asynchronous controllers
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
SIGGRAPH
2010
ACM
15 years 10 months ago
Star-contours for efficient hierarchical self-collision detection
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
Sara C. Schvartzman, Álvaro G. Pérez, Miguel A. ...
CIKM
1994
Springer
15 years 10 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
FOCS
1992
IEEE
15 years 10 months ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
« Prev « First page 1216 / 1452 Last » Next »