Sciweavers

140 search results - page 23 / 28
» Computing the visibility graph of points within a polygon
Sort
View
MM
2006
ACM
197views Multimedia» more  MM 2006»
15 years 5 months ago
Virtual observers in a mobile surveillance system
Conventional wide-area video surveillance systems use a network of fixed cameras positioned close to locations of interest. We describe an alternative and flexible approach to w...
Stewart Greenhill, Svetha Venkatesh
MICRO
2005
IEEE
105views Hardware» more  MICRO 2005»
15 years 5 months ago
Incremental Commit Groups for Non-Atomic Trace Processing
We introduce techniques to support efficient non-atomic execution of very long traces on a new binary translation based, x86-64 compatible VLIW microprocessor. Incrementally comm...
Matt T. Yourst, Kanad Ghose
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
14 years 11 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
SIROCCO
2008
15 years 1 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
CIE
2008
Springer
15 years 1 months ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova