Sciweavers

9949 search results - page 1893 / 1990
» On the Network Complexity of Selection
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
AINA
2009
IEEE
14 years 3 months ago
Predictive Simulation of HPC Applications
The architectures which support modern supercomputing machinery are as diverse today, as at any point during the last twenty years. The variety of processor core arrangements, thr...
Simon D. Hammond, J. A. Smith, Gihan R. Mudalige, ...
ICDCS
2009
IEEE
14 years 3 months ago
On Optimal Concurrency Control for Optimistic Replication
Concurrency control is a core component in optimistic replication systems. To detect concurrent updates, the system associates each replicated object with metadata, such as, versi...
Weihan Wang, Cristiana Amza
CCS
2009
ACM
14 years 3 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...
ICCSA
2009
Springer
14 years 3 months ago
VC-GTS: Virtual Cut-Through GTS Allocation Scheme for Voice Traffic in Multihop IEEE 802.15.4 Systems
Supporting multimedia traffic is one of the major challenges for the next generation of wireless personal area networks (WPANs). Especially, the IEEE 802.15.4 WPAN standards specif...
Junwoo Jung, Hoki Baek, Jaesung Lim
« Prev « First page 1893 / 1990 Last » Next »