Sciweavers

923 search results - page 83 / 185
» The Computational Structure of Progress Conditions
Sort
View
CGF
2010
153views more  CGF 2010»
14 years 10 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
ENTCS
2007
174views more  ENTCS 2007»
14 years 9 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
ACL
1998
14 years 11 months ago
Eliminative Parsing with Graded Constraints
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
Johannes Heinecke, Jürgen Kunze, Wolfgang Men...
CVPR
2007
IEEE
15 years 11 months ago
Towards Fog-Free In-Vehicle Vision Systems through Contrast Restoration
In foggy weather, the contrast of images grabbed by in-vehicle cameras in the visible light range is drastically degraded, which makes the current applications very sensitive to we...
Nicolas Hautière, Jean-Philippe Tarel and Didier ...
IJCAI
2007
14 years 11 months ago
Compiling Bayesian Networks Using Variable Elimination
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network structure. In this paper, we define a new method of comp...
Mark Chavira, Adnan Darwiche