Sciweavers

3020 search results - page 339 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
COMPGEOM
1994
ACM
15 years 11 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
183
Voted
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
15 years 11 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
WIA
2004
Springer
16 years 6 days ago
A BDD-Like Implementation of an Automata Package
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
Jean-Michel Couvreur
171
Voted
SIGMOD
2002
ACM
135views Database» more  SIGMOD 2002»
16 years 7 months ago
StatiX: making XML count
The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query opti...
Juliana Freire, Jayant R. Haritsa, Maya Ramanath, ...
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 11 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo