Sciweavers

2086 search results - page 218 / 418
» Mathematical Theory Exploration
Sort
View
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 8 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
149
Voted
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
ATAL
2007
Springer
15 years 8 months ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
IMAGING
2003
15 years 5 months ago
Group Theoretical Invariants in Color Image Processing
Many image formation processes are complex interactions of several sub-processes and the analysis of the resulting images requires often to separate the influence of these sub-pr...
Reiner Lenz, Linh Viet Tran, Thanh Hai Bui
ICFP
2010
ACM
15 years 5 months ago
TeachScheme!: a checkpoint
In 1995, my team and I decided to create an outreach project that would use our research on functional programming to change the K-12 computer science curriculum. We had two diffe...
Matthias Felleisen