3894 search results - page 156 / 779 » Approximation Algorithms for Biclustering Problems |
167
click to vote
TCBB
2010
15 years 4 months ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
164
click to vote
NIPS
2008
15 years 7 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
165
click to vote
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
208
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
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...
152
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...