Sciweavers

828 search results - page 109 / 166
» Bounded Hairpin Completion
Sort
View
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
14 years 10 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 10 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 4 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
ICFCA
2009
Springer
14 years 4 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
DATE
2009
IEEE
162views Hardware» more  DATE 2009»
14 years 4 months ago
Aelite: A flit-synchronous Network on Chip with composable and predictable services
Abstract—To accommodate the growing number of applications integrated on a single chip, Networks on Chip (NoC) must offer scalability not only on the architectural, but also on t...
Andreas Hansson, Mahesh Subburaman, Kees Goossens