1090 search results - page 176 / 218 » Priority Algorithms for Graph Optimization Problems |
ICDM
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...