Sciweavers

WISES
2003
13 years 11 months ago
Locating Moving Objects over Mobile Sensor Network
The purpose of our on going research would be to track entities, which enter their field of vision over the sensor network. Based on their sightings, they maintain a dynamic cache ...
Arvind Nath Rapaka, Sandeep Bogollu, Donald C. Wun...
VMV
2003
163views Visualization» more  VMV 2003»
13 years 11 months ago
Real-Time Volumetric Intersections of Deforming Objects
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
Bruno Heidelberger, Matthias Teschner, Markus H. G...
VIP
2003
13 years 11 months ago
Optimal Selection of Image Segmentation Algorithms Based on Performance Prediction
Using different algorithms to segment different images is a quite straightforward strategy for automated image segmentation. But the difficulty of the optimal algorithm selection ...
Yong Xia, David Dagan Feng, Rongchun Zhao
VG
2003
13 years 11 months ago
Cell Projection of Convex Polyhedra
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming t...
Stefan Röttger, Thomas Ertl
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 11 months ago
Faster approximation algorithms for the minimum latency problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, David P. Williamson
ACL
1998
13 years 11 months ago
Transforming Lattices into Non-deterministic Automata with Optional Null Arcs
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...
Mark Seligman, Christian Boitet, Boubaker Meddeb-H...
AIPS
2000
13 years 11 months ago
Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
Ioannis Tsamardinos, Martha E. Pollack, John F. Ho...
ACL
2000
13 years 11 months ago
Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
Marcel P. van Lohuizen
SGP
2003
13 years 11 months ago
3D Reconstruction Using Labeled Image Regions
In this paper we present a novel algorithm for reconstructing 3D scenes from a set of images. The user defines a set of polygonal regions with corresponding labels in each image ...
Remo Ziegler, Wojciech Matusik, Hanspeter Pfister,...
AAAI
1998
13 years 11 months ago
Eye Finding via Face Detection for a Foveated Active Vision System
Eye finding is the first step toward building a machine that can recognize social cues, like eye contact and gaze direction, in a natural context. In this paper, we present a real...
Brian Scassellati