Sciweavers

654 search results - page 71 / 131
» Ordered Sets and Complete Lattices
Sort
View
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
13 years 11 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
IEEEPACT
2003
IEEE
14 years 29 days ago
Picking Statistically Valid and Early Simulation Points
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
Erez Perelman, Greg Hamerly, Brad Calder
POPL
1991
ACM
13 years 11 months ago
Subtyping Recursive Types
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
Roberto M. Amadio, Luca Cardelli
ENTCS
2006
181views more  ENTCS 2006»
13 years 7 months ago
Conditional Doxastic Models: A Qualitative Approach to Dynamic Belief Revision
In this paper, we present a semantical approach to multi-agent belief revision and belief update. For this, we introduce relational structures called conditional doxastic models (...
Alexandru Baltag, Sonja Smets
ECCV
2008
Springer
14 years 9 months ago
Calibration from Statistical Properties of the Visual World
What does a blind entity need in order to determine the geometry of the set of photocells that it carries through a changing lightfield? In this paper, we show that very crude know...
Etienne Grossmann, José António Gasp...