Sciweavers

1291 search results - page 135 / 259
» Arithmetic program paths
Sort
View
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
14 years 4 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
ISCC
2005
IEEE
14 years 3 months ago
Degree-Optimal Deterministic Routing for P2P Systems
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
14 years 2 months ago
Mining Genes in DNA Using GeneScout
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...
Michael M. Yin, Jason Tsong-Li Wang
EOR
2007
117views more  EOR 2007»
13 years 10 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
EOR
2002
89views more  EOR 2002»
13 years 9 months ago
Analytic centers and repelling inequalities
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...
Richard J. Caron, Harvey J. Greenberg, Allen G. Ho...