6656 search results - page 96 / 1332 » Change, Change, Change: Three Approaches |
181
click to vote
FCCM
2002
IEEE
15 years 12 months ago
2002
IEEE
C-slow retiming (changing a design to support multiple instances of a computation) and datapath-aware placement have long been advocated by members of the FPGA synthesis community...
146
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
The three results on the PageRank vector are preliminary but shed light on the eigenstructure of a PageRank modified Markov chain and what happens when changing the teleportation ...
165
click to vote
IEEEARES
2007
IEEE
16 years 1 months ago
2007
IEEE
—In this paper, we formulate and realize a definition of security for three-party key distribution within the universally composable (UC) framework. That is, an appropriate ideal...
200
click to vote
CPHYSICS
2004
15 years 6 months ago
2004
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
153
click to vote
GD
2005
Springer
16 years 12 days ago
2005
Springer
Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some gen...