Sciweavers

5658 search results - page 31 / 1132
» An Efficient Counting Network
Sort
View
ICWN
2004
13 years 11 months ago
Improvements to Location-Aided Routing Through Directional Count Restrictions
We present an effective way to improve the quality of unicast routes determined by the LAR Box method. Our method uses the location information acquired by LAR itself to determine ...
Michael Colagrosso, Nathan Enochs, Tracy Camp
DAM
2008
103views more  DAM 2008»
13 years 10 months ago
Counting preimages of TCP reordering patterns
Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial pro...
Anders Hansson, Gabriel Istrate
HICSS
2002
IEEE
94views Biometrics» more  HICSS 2002»
14 years 2 months ago
The Relationship between Scene and Eye Movements
Individual differences make it difficult to recognize similarities between individuals in eye movement patterns. However, if consistencies can be found, eye movements could be use...
Laurel King
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 12 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 10 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall