Sciweavers

5169 search results - page 49 / 1034
» Locality approximation using time
Sort
View
MOBIHOC
2002
ACM
16 years 1 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
ICCBR
2003
Springer
15 years 7 months ago
Using Evolution Programs to Learn Local Similarity Measures
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
Armin Stahl, Thomas Gabel
100
Voted
ICIP
2003
IEEE
16 years 3 months ago
Object localization using texture motifs and Markov random fields
This work presents a novel approach to object localization in complex imagery. In particular, the spatial extents of objects characterized by distinct spatial signatures at multip...
Shawn Newsam, Sitaram Bhagavathy, B. S. Manjunath
APNOMS
2006
Springer
15 years 6 months ago
Network-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
Jeongsoo Han
ACCV
2009
Springer
15 years 4 months ago
Image Classification Using Probability Higher-Order Local Auto-Correlations
Abstract. In this paper, we propose a novel method for generic object recognition by using higher-order local auto-correlations on probability images. The proposed method is an ext...
Tetsu Matsukawa, Takio Kurita