Sciweavers

4377 search results - page 673 / 876
» Mass problems and randomness
Sort
View
IPSN
2011
Springer
14 years 10 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang

Publication
179views
17 years 4 months ago
Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in...
R. Jain

Publication
189views
17 years 4 months ago
Packet Trains-Measurements and a New Model for Computer Network Traffic
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
R. Jain, S. Routhier
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...