2536 search results - page 116 / 508 » Constructing Optimal Highways |
105
click to vote
INFOCOM
1995
IEEE
15 years 3 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
179
click to vote
CVPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
113
click to vote
LREC
2010
15 years 1 months ago
2010
Unit selection text-to-speech systems currently produce very natural synthesized phrases by concatenating speech segments from a large database. Recently, increasing demand for de...
ICISC
2008
15 years 1 months ago
2008
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
MP
1998
14 years 11 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...