Sciweavers

1414 search results - page 140 / 283
» Randomness and Universal Machines
Sort
View
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
15 years 4 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
94
Voted
SOCRATES
2008
15 years 2 months ago
Supporting Learners Collaborative Knowledge Construction by External Representations
External representations can be powerful to support learners' collaborative knowledge construction. They can focus learners on aspects which are particularly important for th...
Bernhard Ertl, Birgitta Kopp, Heinz Mandl
91
Voted
ACL
2006
15 years 2 months ago
LexNet: A Graphical Environment for Graph-Based NLP
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarizatio...
Dragomir R. Radev, Günes Erkan, Anthony Fader...
123
Voted
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 2 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
DC
2008
15 years 23 days ago
The weakest failure detectors to boost obstruction-freedom
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov