Sciweavers

597 search results - page 25 / 120
» Dominating Distributions and Learnability
Sort
View
139
Voted
SIGDOC
2005
ACM
15 years 10 months ago
Usability over time
Testing of usability could perhaps be more accurately described as testing of learnability. We know more about the problems of novice users than we know of the problems of experie...
Valerie Mendoza, David G. Novick
ALT
1998
Springer
15 years 9 months ago
PAC Learning from Positive Statistical Queries
Learning from positive examples occurs very frequently in natural learning. The PAC learning model of Valiant takes many features of natural learning into account, but in most case...
François Denis
ATAL
2008
Springer
15 years 7 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
ICCD
2008
IEEE
167views Hardware» more  ICCD 2008»
15 years 11 months ago
Exploiting spare resources of in-order SMT processors executing hard real-time threads
— We developed an SMT processor that allows a static WCET analysis of several hard real-time threads and uses the remaining resources for soft or non real-time threads. The analy...
Jörg Mische, Sascha Uhrig, Florian Kluge, The...
170
Voted
DC
2010
15 years 5 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer