Sciweavers

604 search results - page 75 / 121
» Aggregate Computation over Data Streams
Sort
View
PODS
2003
ACM
158views Database» more  PODS 2003»
15 years 12 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
CLUSTER
2010
IEEE
14 years 3 months ago
Middleware support for many-task computing
Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes highperformance co...
Ioan Raicu, Ian T. Foster, Mike Wilde, Zhao Zhang,...
HOTI
2008
IEEE
15 years 6 months ago
A High-Speed Optical Multi-Drop Bus for Computer Interconnections
Buses have historically provided a flexible communications structure in computer systems. However, signal integrity constraints of high-speed electronics have made multi-drop elec...
Michael R. T. Tan, Paul Rosenberg, Jong Souk Yeo, ...
104
Voted
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 6 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
ICPR
2010
IEEE
14 years 9 months ago
A Practical Heterogeneous Classifier for Relational Databases
Most enterprise data is distributed in multiple relational databases with expert-designed schema. Using traditional single-table machine learning techniques over such data not onl...
Geetha Manjunath, M. Narasimha Murty, Dinkar Sitar...