3946 search results - page 679 / 790 » The computational complexity of choice sets |
164
click to vote
CCR
2008
15 years 6 months ago
2008
As significant resources are directed towards clean-slate networking research, it is imperative to understand how cleanslate architectural research compares to the diametrically o...
180
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
173
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...