10608 search results - page 628 / 2122 » Complexity of O'Hara's Algorithm |
234
click to vote
IEEEMSP
2002
IEEE
16 years 4 days ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
193
click to vote
PPDP
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
293
click to vote
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
196
click to vote
ECML
2006
Springer
15 years 11 months ago
2006
Springer
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
218
click to vote
FORTE
2010
15 years 8 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...