5595 search results - page 836 / 1119 » Approximation Algorithms for Clustering Problems |
164
click to vote
COCOON
2005
Springer
16 years 6 days ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
215
click to vote
SPIRE
2005
Springer
16 years 4 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
177
click to vote
SPAA
2005
ACM
16 years 7 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
164
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
Appropriate rate control plays a very important role in encoding motion pictures under the constant bit-rate. One of the requirements for rate control is minimizing temporal fluct...
191
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper we explore the problem of accurately segmenting a person from a video given only approximate location of that person. Unlike previous work which assumes that the app...