Sciweavers

2877 search results - page 492 / 576
» The Complexity of Planarity Testing
Sort
View
133
Voted
AOSD
2007
ACM
15 years 7 months ago
Debugging with control-flow breakpoints
Modern source-level debuggers support dynamic breakpoints that are guarded by conditions based on program state. Such breakpoints address situations where a static breakpoint is n...
Rick Chern, Kris De Volder
100
Voted
EXPCS
2007
15 years 7 months ago
Rapid file system development using ptrace
Developing kernel-level file systems is a difficult task that requires a significant time investment. For experimental file systems, it is desirable to develop a prototype before ...
Richard P. Spillane, Charles P. Wright, Gopalan Si...
125
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
Efficient Multicast Support in Buffered Crossbars using Networks on Chip
The Internet growth coupled with the variety of its services is creating an increasing need for multicast traffic support by backbone routers and packet switches. Recently, buffere...
Iria Varela Senin, Lotfi Mhamdi, Kees Goossens
135
Voted
FOCS
2004
IEEE
15 years 7 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
134
Voted
AFRIGRAPH
2003
ACM
15 years 7 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...