Sciweavers

1539 search results - page 37 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
PAMI
2002
148views more  PAMI 2002»
15 years 1 months ago
Two Variations on Fisher's Linear Discriminant for Pattern Recognition
Discriminants are often used in pattern recognition to separate clusters of points in some multidimensional "feature" space. This paper provides two fast and simple techn...
Tristrom Cooke
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 2 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
CAIP
1999
Springer
143views Image Analysis» more  CAIP 1999»
15 years 6 months ago
Frame-Relative Critical Point Sets in Image Analysis
Abstract. We propose a new computational method for segmenting topological sub-dimensional point-sets in scalar images of arbitrary spatial dimensions. The technique is based on co...
Stiliyan Kalitzin, Joes Staal, Bart M. ter Haar Ro...
ICNP
2002
IEEE
15 years 7 months ago
A Simple and Scalable Fair Bandwidth Sharing Mechanism for Multicast Flows
Despite a decade of research and development, multicast has not yet been deployed on a global scale. Among the difficulties with the current infrastructure are intermulticast fai...
Fethi Filali, Walid Dabbous
CVPR
2012
IEEE
13 years 4 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn