789 search results - page 112 / 158 » On Theory Revision with Queries |
110
Voted
ECCC
2008
15 years 24 days ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
113
Voted
SIGIR
2008
ACM
15 years 19 days ago
2008
ACM
Collaborative Filtering (CF) requires user-rated training examples for statistical inference about the preferences of new users. Active learning strategies identify the most infor...
117
click to vote
ML
2007
ACM
15 years 7 days ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
89
Voted
TALG
2010
14 years 11 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
130
click to vote
SISAP
2010
IEEE
14 years 10 months ago
2010
IEEE
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...