Sciweavers

70 search results - page 8 / 14
» Frequency-distance constraints with large distances
Sort
View
IJRR
2007
104views more  IJRR 2007»
13 years 9 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 1 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
COR
2008
142views more  COR 2008»
13 years 9 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CVPR
2008
IEEE
14 years 12 months ago
Fast image search for learned metrics
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
Prateek Jain, Brian Kulis, Kristen Grauman
ICB
2009
Springer
355views Biometrics» more  ICB 2009»
14 years 4 months ago
3D Signatures for Fast 3D Face Recognition
We propose a vector representation (called a 3D signature) for 3D face shape in biometrics applications. Elements of the vector correspond to fixed surface points in a face-centere...
Chris Boehnen, Tanya Peters, Patrick J. Flynn