Sciweavers

564 search results - page 15 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
ECCV
2008
Springer
14 years 9 months ago
A Linear Time Histogram Metric for Improved SIFT Matching
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...
Ofir Pele, Michael Werman
ATAL
2008
Springer
13 years 9 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
IPL
2002
74views more  IPL 2002»
13 years 7 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
PRL
2002
69views more  PRL 2002»
13 years 7 months ago
Variant code transformations for linear quadtrees
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
Pei-Min Chen