1158 search results - page 117 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
163
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
188
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
154
click to vote
RTSS
1999
IEEE
15 years 10 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
160
click to vote
JUCS
2006
15 years 6 months ago
2006
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
189
click to vote
ALMOB
2006
15 years 6 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...