986 search results - page 125 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
115
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
132
Voted
NIPS
2001
15 years 5 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
136
click to vote
COLT
1994
Springer
15 years 8 months ago
1994
Springer
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
265
Voted
PVLDB
2011
14 years 11 months ago
2011
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
107
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...