Sciweavers

4850 search results - page 110 / 970
» Approximate Data Structures with Applications
Sort
View
VLDB
2004
ACM
106views Database» more  VLDB 2004»
15 years 3 months ago
Structures, Semantics and Statistics
At a fundamental level, the key challenge in data integration is to reconcile the semantics of disparate data sets, each expressed with a different database structure. I argue th...
Alon Y. Halevy
NETWORKING
2007
14 years 11 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
14 years 11 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
15 years 10 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
15 years 6 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...