Sciweavers

2262 search results - page 253 / 453
» Points with large quadrant-depth
Sort
View
PERCOM
2005
ACM
16 years 6 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
POPL
2010
ACM
16 years 4 months ago
Integrating Typed and Untyped Code in a Scripting Language
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
Francesco Zappa Nardelli, Jan Vitek, Johan Ös...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 3 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
HYPERTEXT
2009
ACM
16 years 3 months ago
The dynamics of personal territories on the web
In this paper, we present a long-term study of user-centric Web traffic data collected in 2000-2002 and 2005-2006 from two large representative panels of French Internet users. Ou...
Thomas Beauvisage
ICDCS
2009
IEEE
16 years 3 months ago
Minimizing the Hidden Cost of RDMA
Remote Direct Memory Access (RDMA) is a mechanism whereby data is moved directly between the application memory of the local and remote computer. In bypassing the operating system...
Philip Werner Frey, Gustavo Alonso