Sciweavers

2904 search results - page 427 / 581
» Number Forms in the Brain
Sort
View
TON
2002
175views more  TON 2002»
15 years 6 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
15 years 6 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...
COMCOM
2008
99views more  COMCOM 2008»
15 years 6 months ago
SPICE: Scalable P2P implicit group messaging
Implicit group messaging (IGM) is a decoupled messaging paradigm for connecting content publishers and consumers over the Internet. Unlike traditional multicast or publish/subscri...
Daniel Cutting, Aaron J. Quigley, Björn Landf...
COR
2008
129views more  COR 2008»
15 years 6 months ago
Queues in DOCSIS cable modem networks
In this paper we determine the optimal fraction c of the uplink channel capacity that should be dedicated to the contention channel in a DOCSIS cable network in order to minimize ...
Joke Lambert, Benny Van Houdt, Chris Blondia
NETWORKS
2007
15 years 6 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu