Sciweavers

1552 search results - page 99 / 311
» On the Complexity of Constant Propagation
Sort
View
COMPGEOM
2009
ACM
16 years 27 days ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
ICC
2007
IEEE
133views Communications» more  ICC 2007»
16 years 21 days ago
Machine Learning for Automatic Defence Against Distributed Denial of Service Attacks
— Distributed Denial of Service attacks pose a serious threat to many businesses which rely on constant availability of their network services. Companies like Google, Yahoo and A...
Stefan Seufert, Darragh O'Brien
SIGGRAPH
2000
ACM
15 years 10 months ago
Image-based visual hulls
In this paper, we describe an efficient image-based approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry a...
Wojciech Matusik, Chris Buehler, Ramesh Raskar, St...
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
15 years 10 months ago
A Duality between Clause Width and Clause Density for SAT
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
Chris Calabro, Russell Impagliazzo, Ramamohan Patu...
EVOW
2008
Springer
15 years 8 months ago
Evolving an Automatic Defect Classification Tool
Automatic Defect Classification (ADC) is a well-developed technology for inspection and measurement of defects on patterned wafers in the semiconductors industry. The poor training...
Assaf Glazer, Moshe Sipper