Sciweavers

79 search results - page 8 / 16
» On the Relaxation of n-detect Test Sets
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
A combined linear programming-maximum likelihood approach to radial velocity data analysis for extrasolar planet detection
In this paper we introduce a new technique for estimating the parameters of the Keplerian model commonly used in radial velocity data analysis for extrasolar planet detection. The...
Prabhu Babu, Petre Stoica
60
Voted
RECOMB
2005
Springer
15 years 9 months ago
RIBRA-An Error-Tolerant Algorithm for the NMR Backbone Assignment Problem
We develop an iterative relaxation algorithm, called RIBRA, for NMR protein backbone assignment. RIBRA applies nearest neighbor and weighted maximum independent set algorithms to ...
Kuen-Pin Wu, Jia-Ming Chang, Jun-Bo Chen, Chi-Fon ...
CVPR
2009
IEEE
16 years 4 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
TAPIA
2003
ACM
15 years 2 months ago
A new infeasible interior-point algorithm for linear programming
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
Miguel Argáez, Leticia Velázquez
EOR
2007
111views more  EOR 2007»
14 years 9 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada