Sciweavers

5877 search results - page 1086 / 1176
» Advanced High Performance Algorithms for Data Processing
Sort
View
PODC
2005
ACM
15 years 10 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
SIGCOMM
1997
ACM
15 years 8 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker
WSNA
2003
ACM
15 years 9 months ago
Analyzing and modeling encryption overhead for sensor network nodes
Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in...
Prasanth Ganesan, Ramnath Venugopalan, Pushkin Ped...
CIKM
2009
Springer
15 years 11 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
IWNAS
2008
IEEE
15 years 11 months ago
POND: The Power of Zone Overlapping in DHT Networks
— Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan
« Prev « First page 1086 / 1176 Last » Next »