Sciweavers

1399 search results - page 65 / 280
» New Algorithms for k-Center and Extensions
Sort
View
EDBT
2011
ACM
281views Database» more  EDBT 2011»
13 years 20 days ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
TMC
2011
203views more  TMC 2011»
13 years 4 months ago
Throughput Optimization in Mobile Backbone Networks
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
TON
2010
139views more  TON 2010»
13 years 3 months ago
Opportunistic and Cooperative Spatial Multiplexing in MIMO Ad Hoc Networks
With the fast progress of MIMO technology and its growing applications in networks, it is important to develop techniques to enable more efficient MIMO network communications. Howe...
Shan Chu, Xin Wang
CIKM
2011
Springer
12 years 9 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
TSE
2010
180views more  TSE 2010»
13 years 7 months ago
Aspect-Oriented Race Detection in Java
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
Eric Bodden, Klaus Havelund