Sciweavers

6274 search results - page 197 / 1255
» From query complexity to computational complexity
Sort
View
128
Voted
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 4 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 4 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
15 years 2 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
EDBTW
2006
Springer
15 years 8 months ago
A Data and Query Model for Streaming Geospatial Image Data
Abstract. Most of the recent work on adaptive processing and continuous querying of data streams assume that data objects come in the form of tuples, thus relying on the relational...
Michael Gertz, Quinn Hart, Carlos Rueda, Shefali S...
PDIS
1994
IEEE
15 years 8 months ago
An Economic Paradigm for Query Processing and Data Migration in Mariposa
Many new database applications require very large volumes of data. Mariposa is a data base system under construction at Berkeley responding to this need. Mariposa objects can be s...
Michael Stonebraker, Robert Devine, Marcel Kornack...