Sciweavers

6367 search results - page 1079 / 1274
» From Statistics to Beliefs
Sort
View
JCDL
2010
ACM
199views Education» more  JCDL 2010»
15 years 11 months ago
Crowdsourcing the assembly of concept hierarchies
The“wisdom of crowds”is accomplishing tasks that are cumbersome for individuals yet cannot be fully automated by means of specialized computer algorithms. One such task is the...
Kai Eckert, Mathias Niepert, Christof Niemann, Cam...
WEBDB
2010
Springer
152views Database» more  WEBDB 2010»
15 years 11 months ago
Popularity-Guided Top-k Extraction of Entity Attributes
Recent progress in information extraction technology has enabled a vast array of applications that rely on structured data that is embedded in natural-language text. In particular...
Matthew Solomon, Cong Yu, Luis Gravano
SIGMETRICS
2010
ACM
143views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
Practical performance models for complex, popular applications
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...
Eno Thereska, Bjoern Doebel, Alice X. Zheng, Peter...
COLT
1999
Springer
15 years 10 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 10 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
« Prev « First page 1079 / 1274 Last » Next »