Sciweavers

1647 search results - page 294 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
SPAA
2005
ACM
14 years 2 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
ISMAR
2002
IEEE
14 years 1 months ago
Accurate Camera Calibration for Off-line, Video-Based Augmented Reality
Camera tracking is a fundamental requirement for videobased Augmented Reality applications. The ability to accurately calculate the intrinsic and extrinsic camera parameters for e...
Simon Gibson, Jonathan Cook, Toby Howard, Roger J....
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
14 years 25 days ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
ECAI
2010
Springer
13 years 9 months ago
Mining Outliers with Adaptive Cutoff Update and Space Utilization (RACAS)
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...
Chi-Cheong Szeto, Edward Hung
JSAC
2006
183views more  JSAC 2006»
13 years 8 months ago
HiRLoc: high-resolution robust localization for wireless sensor networks
In this paper we address the problem of robustly estimating the position of randomly deployed nodes of a Wireless Sensor Network (WSN), in the presence of security threats. We prop...
Loukas Lazos, Radha Poovendran