Sciweavers

3690 search results - page 240 / 738
» Computation with classical sequents
Sort
View
108
Voted
COR
2008
102views more  COR 2008»
15 years 11 days ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
88
Voted
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 27 days ago
Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
Laurent Najman
LICS
2010
IEEE
14 years 11 months ago
An Intuitionistic Logic that Proves Markov's Principle
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
Hugo Herbelin
146
Voted
CGF
2010
234views more  CGF 2010»
14 years 10 months ago
3D Surface Reconstruction Using a Generalized Distance Function
We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points. This distance function...
R. Poranne, Craig Gotsman, Daniel Keren
115
Voted
FOSSACS
2011
Springer
14 years 4 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...