Sciweavers

4761 search results - page 583 / 953
» Generalizing Boundary Points
Sort
View
CCR
2005
131views more  CCR 2005»
15 years 6 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
174
Voted
JITECH
2007
136views more  JITECH 2007»
15 years 6 months ago
A computer scientist's reactions to NPfIT
This paper contains a set of personal views relating to NHS Connecting for Health’s National Programme for IT (NPfIT), and in particular its Care Records Service, written from t...
Brian Randell
IJRR
2002
129views more  IJRR 2002»
15 years 6 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
PAMI
2007
161views more  PAMI 2007»
15 years 6 months ago
Silhouette Coherence for Camera Calibration under Circular Motion
We present a new approach to camera calibration as a part of a complete and practical system to recover digital copies of sculpture from uncalibrated image sequences taken under t...
Carlos Hernández, Francis Schmitt, Roberto ...
216
Voted
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 5 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