3894 search results - page 404 / 779 » Approximation Algorithms for Biclustering Problems |
162
click to vote
IMR
2003
Springer
15 years 10 months ago
2003
Springer
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
151
click to vote
ICRA
1998
IEEE
15 years 9 months ago
1998
IEEE
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...
185
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
127
click to vote
JDA
2008
15 years 4 months ago
2008
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
133
click to vote
JAL
2007
15 years 4 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...