4131 search results - page 452 / 827 » The Generalized Max-Controlled Set Problem |
225
click to vote
CPM
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
196
click to vote
COMPGEOM
2004
ACM
16 years 26 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
222
click to vote
MOBICOM
2004
ACM
16 years 26 days ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
189
click to vote
DAGM
2004
Springer
16 years 25 days ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
222
click to vote
SIGADA
2004
Springer
16 years 23 days ago
2004
Springer
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...