Sciweavers

557 search results - page 46 / 112
» Optimization Algorithms for Large Self-Structuring Networks
Sort
View
WWW
2007
ACM
14 years 8 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
PAMI
2007
202views more  PAMI 2007»
13 years 7 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
PAM
2011
Springer
12 years 10 months ago
Evolution of Cache Replacement Policies to Track Heavy-Hitter Flows
Several important network applications cannot easily scale to higher data rates without requiring focusing just on the large traffic flows. Recent works have discussed algorithmic...
Martin Zádník, Marco Canini
MASS
2010
119views Communications» more  MASS 2010»
13 years 5 months ago
Energy-efficient data redistribution in sensor networks
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...
Bin Tang, Neeraj Jaggi, Haijie Wu, Rohini Kurkal
INFOCOM
2011
IEEE
12 years 11 months ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...