Sciweavers

6251 search results - page 458 / 1251
» Randomness, Computability, and Density
Sort
View
EURONGI
2008
Springer
15 years 8 months ago
Location Management Based on the Mobility Patterns of Mobile Users
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
Ignacio Martinez-Arrue, Pablo García-Escall...
CCGRID
2010
IEEE
15 years 8 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
15 years 6 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
DCC
2010
IEEE
15 years 4 months ago
Optimization of Overlapped Tiling for Efficient 3D Image Retrieval
Remote visualization of an arbitrary 2-D planar "cut" from a large volumetric dataset with random access has both gained importance and posed significant challenges over...
Zihong Fan, Antonio Ortega
CVPR
2011
IEEE
15 years 2 months ago
Learning Context for Collective Activity Recognition
In this paper we present a framework for the recognition of collective human activities. A collective activity is defined or reinforced by the existence of coherent behavior of i...
Wongun Choi, Silvio Savarese, Khuram Shahid