Sciweavers

697 search results - page 107 / 140
» On the Theory of Average Case Complexity
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
COMPGEOM
2004
ACM
14 years 1 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
COLT
2004
Springer
14 years 1 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter
ESAW
2004
Springer
14 years 1 months ago
Motivation-Based Selection of Negotiation Opponents
Abstract. If we are to enable agents to handle increasingly greater levels of complexity, it is necessary to equip them with mechanisms that support greater degrees of autonomy. Th...
Stephen J. Munroe, Michael Luck
HICSS
2003
IEEE
92views Biometrics» more  HICSS 2003»
14 years 1 months ago
Human-Robot Interaction for Intelligent Assisted Viewing During Teleoperation
The Visual Acts theory aims to provide intelligent assistance for camera viewpoint selection during teleoperation. It combines top-down partitioning of a task and bottom-up monito...
Gerard T. McKee, Bernard G. Brooks, Paul S. Schenk...