Sciweavers

11808 search results - page 75 / 2362
» Isometries and Computability Structures
Sort
View
AI
2008
Springer
13 years 9 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
MM
1996
ACM
168views Multimedia» more  MM 1996»
14 years 1 months ago
Do Story Agents Use Rocking Chairs? The Theory and Implementation of One Model for Computational Narrative
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...
Kevin M. Brooks
MICRO
2003
IEEE
152views Hardware» more  MICRO 2003»
14 years 2 months ago
A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor
Single-event upsets from particle strikes have become a key challenge in microprocessor design. Techniques to deal with these transient faults exist, but come at a cost. Designers...
Shubhendu S. Mukherjee, Christopher T. Weaver, Joe...
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
13 years 10 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount
AUTOMATICA
2007
75views more  AUTOMATICA 2007»
13 years 9 months ago
Systematic ultimate bound computation for sampled-data systems with quantization
We present a novel systematic method to obtain componentwise ultimate bounds in perturbed sampled-data systems, especially when the perturbations arise due to quantization. The pr...
Hernan Haimovich, Ernesto Kofman, María M. ...