Sciweavers

1089 search results - page 212 / 218
» Randomness and Reducibility
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 6 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
IANDC
2010
84views more  IANDC 2010»
13 years 6 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit de...
Arie Matsliah, Ofer Strichman
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
13 years 6 months ago
Rao-Blackwellized particle filtering for probing-based 6-DOF localization in robotic assembly
This paper presents a probing-based method for probabilistic localization in automated robotic assembly. We consider peg-in-hole problems in which a needle-like peg has a single p...
Yuichi Taguchi, Tim K. Marks, Haruhisa Okuda
INFOCOM
2010
IEEE
13 years 6 months ago
A Signal Processing View on Packet Sampling and Anomaly Detection
—Anomaly detection methods typically operate on pre-processed, i.e., sampled and aggregated, traffic traces. Most traffic capturing devices today employ random packet sampling,...
Daniela Brauckhoff, Kavé Salamatian, Martin...
INFOCOM
2010
IEEE
13 years 6 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...