7167 search results - page 1129 / 1434 » Answer Set Programming |
138
click to vote
ALT
1995
Springer
15 years 6 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
119
click to vote
DAC
2005
ACM
15 years 4 months ago
2005
ACM
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
148
click to vote
PETRA
2010
ACM
15 years 4 months ago
2010
ACM
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
134
click to vote
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
132
click to vote
AAAI
2004
15 years 4 months ago
2004
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...