Sciweavers

5158 search results - page 904 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 3 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICS
2010
Tsinghua U.
16 years 3 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
EUROSYS
2006
ACM
16 years 3 months ago
Database replication policies for dynamic content applications
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
Gokul Soundararajan, Cristiana Amza, Ashvin Goel
ALT
2006
Springer
16 years 3 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
ALT
2005
Springer
16 years 3 months ago
Non U-Shaped Vacillatory and Team Learning
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science...
Lorenzo Carlucci, John Case, Sanjay Jain, Frank St...