1538 search results - page 132 / 308 » Spectral Techniques in Graph Algorithms |
127
click to vote
IJCV
2006
15 years 1 months ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
113
click to vote
ISCIS
2004
Springer
15 years 7 months ago
2004
Springer
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
114
click to vote
AAIM
2008
Springer
15 years 3 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
119
click to vote
IJNSEC
2007
15 years 1 months ago
2007
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
ICPR
2000
IEEE
16 years 2 months ago
2000
IEEE
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...