Sciweavers

1403 search results - page 269 / 281
» Set cover algorithms for very large datasets
Sort
View
EUROPAR
2003
Springer
15 years 9 months ago
FOBS: A Lightweight Communication Protocol for Grid Computing
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
Phillip M. Dickens
FOCS
2002
IEEE
15 years 9 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
INFOCOM
2006
IEEE
15 years 10 months ago
Broadcasting in Sensor Networks: The Role of Local Information
Abstract— Flooding based strategies are conventionally employed to perform querying and broadcasting in sensor networks. These schemes have low hop-delays of Θ( 1 M(n) ) to reac...
Sundar Subramanian, Sanjay Shakkottai, Ari Arapost...
SBCCI
2005
ACM
98views VLSI» more  SBCCI 2005»
15 years 9 months ago
Mapping embedded systems onto NoCs: the traffic effect on dynamic energy estimation
This work addresses the problem of application mapping in networks-on-chip (NoCs). It explores the importance of characterizing network traffic to effectively predict NoC energy c...
José Carlos S. Palma, César A. M. Ma...
CIKM
2009
Springer
15 years 8 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...