Sciweavers

221 search results - page 40 / 45
» Graph matching with type constraints on nodes and edges
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
Distributed Optimal Estimation from Relative Measurements for Localization and Time Synchronization
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
Prabir Barooah, Neimar Machado da Silva, Joã...
CVPR
2010
IEEE
13 years 5 months ago
Common visual pattern discovery via spatially coherent correspondences
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
Hairong Liu, Shuicheng Yan
ATMN
1996
13 years 9 months ago
Dynamic time sharing: a new approach for congestion management
A new approach for bandwidth allocation and congestion control is reported in this paper, which is of the Rate Controlled admission with Priority Scheduling service type. It is ca...
Adrian Popescu, Parag Pruthi
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ACG
2009
Springer
14 years 2 months ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen