Sciweavers

15033 search results - page 270 / 3007
» Complexity Theory and Algorithms
Sort
View
154
Voted
SI3D
2003
ACM
15 years 10 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
15 years 9 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
149
Voted
CVPR
2010
IEEE
16 years 1 months ago
A Theory of Plenoptic Multiplexing
Multiplexing is a common technique for encoding highdimensional image data into a single, two-dimensional image. Examples of spatial multiplexing include Bayer patterns to capture...
Ivo Ihrke, Gordon Wetzstein, Wolfgang Heidrich
119
Voted
APN
2007
Springer
15 years 11 months ago
Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios
In this paper we develop a theory for the region-based synthesis of system models given as place/transition-nets with weighted inhibitor arcs (ptinets) from sets of scenarios descr...
Robert Lorenz, Sebastian Mauser, Robin Bergenthum
PRICAI
2004
Springer
15 years 10 months ago
Model Theory for PRS-Like Agents: Modelling Belief Update and Action Attempts
In this paper, we extend our earlier work on modelling the mental states of PRS-like agents by considering the dynamics of belief and modelling of action attempts. The major constr...
Wayne Wobcke