Sciweavers

1133 search results - page 109 / 227
» Basics of Graph Cuts
Sort
View
RTA
2010
Springer
15 years 1 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
CP
2006
Springer
15 years 1 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
AES
2007
Springer
141views Cryptology» more  AES 2007»
14 years 10 months ago
Numerical methods for modelling leaching of pollutants in soils
Pesticides used in crop production and herbicides used for weed control are the major source of nonpoint-source pollutants to groundwater. The movement and degradation of pesticid...
M. Isabel Asensio, B. Ayuso, Luis Ferragut, G. San...
CGF
2002
116views more  CGF 2002»
14 years 9 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
GG
2004
Springer
15 years 3 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...