Sciweavers

6393 search results - page 409 / 1279
» Randomized Algorithms on the Mesh
Sort
View
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 7 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
KBSE
2007
IEEE
16 years 1 months ago
Nighthawk: a two-level genetic-random unit test data generator
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
James H. Andrews, Felix Chun Hang Li, Tim Menzies
EIT
2008
IEEE
16 years 1 months ago
Defending selective forwarding attacks in WMNs
—Wireless Mesh Networks (WMNs) have emerged recently as a promising technology for next-generation wireless networking to provide wide variety of applications that cannot be supp...
Devu Manikantan Shila, Tricha Anjali
199
Voted
COMPGEOM
2000
ACM
15 years 11 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
DATE
2004
IEEE
158views Hardware» more  DATE 2004»
15 years 10 months ago
Bandwidth-Constrained Mapping of Cores onto NoC Architectures
We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the e...
Srinivasan Murali, Giovanni De Micheli