Sciweavers

4565 search results - page 162 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
COMPGEOM
2010
ACM
14 years 3 months ago
Optimal reconstruction might be hard
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
Dominique Attali, André Lieutier
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 12 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 5 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
KDD
2009
ACM
143views Data Mining» more  KDD 2009»
14 years 11 months ago
Optimizing web traffic via the media scheduling problem
Website traffic varies through time in consistent and predictable ways, with highest traffic in the middle of the day. When providing media content to visitors, it is important to...
Lars Backstrom, Jon M. Kleinberg, Ravi Kumar
INDOCRYPT
2001
Springer
14 years 2 months ago
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
Harald Baier