2004 search results - page 286 / 401 » Sampling from large graphs |
117
click to vote
STOC
1997
ACM
15 years 6 months ago
1997
ACM
Abstract. We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called “experts.” These simple a...
120
click to vote
DAC
1994
ACM
15 years 6 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
103
click to vote
CIDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
141
click to vote
UIST
1995
ACM
15 years 6 months ago
1995
ACM
A fundamental issue in user interface design is the effective use of available screen space, commonly referred to as the screen real estate problem. This paper presents a new dist...
128
click to vote
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...