Sciweavers

1729 search results - page 332 / 346
» Bound Graph Polysemy
Sort
View
MOBIHOC
2009
ACM
14 years 8 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
MOBIHOC
2008
ACM
14 years 7 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
MOBIHOC
2006
ACM
14 years 7 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
ICIP
2009
IEEE
14 years 5 months ago
Edge-preserving Colorization using Data-Driven Random Walks with Restart
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
Tae Hoon Kim (Seoul National University), Kyoung M...