14403 search results - page 165 / 2881 » Dynamical Systems Trees |
127
click to vote
LISA
2001
15 years 5 months ago
2001
After installing an OS distribution, a computer is generally not yet properly adapted to go into production at the local site. Security policies must be implemented, local service...
150
click to vote
RP
2010
Springer
15 years 2 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
138
click to vote
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
124
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
145
click to vote
NBIS
2007
Springer
15 years 10 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...