Sciweavers

1554 search results - page 306 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
FOCS
1999
IEEE
13 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
RTSS
1999
IEEE
13 years 11 months ago
A Scalable Solution to the Multi-Resource QoS Problem
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
Chen Lee, John P. Lehoczky, Daniel P. Siewiorek, R...
ANSS
1996
IEEE
13 years 11 months ago
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
Aad P. A. van Moorsel, Latha A. Kant, William H. S...
AMFG
2007
IEEE
238views Biometrics» more  AMFG 2007»
13 years 11 months ago
Towards Pose-Invariant 2D Face Classification for Surveillance
A key problem for "face in the crowd" recognition from existing surveillance cameras in public spaces (such as mass transit centres) is the issue of pose mismatches betwe...
Conrad Sanderson, Ting Shan, Brian C. Lovell
SIGGRAPH
2010
ACM
13 years 11 months ago
FASTCD: fracturing-aware stable collision detection
We present a collision detection (CD) method for complex and large-scale fracturing models that have geometric and topological changes. We first propose a novel dual-cone culling...
Jae-Pil Heo, Duksu Kim, Joon-Kyung Seong, Jeong-Mo...