Sciweavers

654 search results - page 127 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 7 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
COMCOM
2004
98views more  COMCOM 2004»
13 years 7 months ago
End system multicast: an architectural infrastructure and topological optimization
Although IP-multicast has been proposed and investigated for years, there are major problems inherent in the IP-multicasting technique, e.g., difficulty to scale up the system, di...
Starsky H. Y. Wong, John C. S. Lui
TIT
2008
141views more  TIT 2008»
13 years 7 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli
GLVLSI
2003
IEEE
146views VLSI» more  GLVLSI 2003»
14 years 25 days ago
A practical CAD technique for reducing power/ground noise in DSM circuits
One of the fundamental problems in Deep Sub Micron (DSM) circuits is Simultaneous Switching Noise (SSN), which causes voltage fluctuations in the circuit power/ground networks. In...
Arindam Mukherjee, Krishna Reddy Dusety, Rajsaktis...