1686 search results - page 163 / 338 » Programs as polygraphs: computability and complexity |
114
click to vote
ICPR
2006
IEEE
15 years 9 months ago
2006
IEEE
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
179
Voted
ACL2
2006
ACM
15 years 9 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
122
click to vote
SAC
2004
ACM
15 years 9 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
118
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we use a digital signal processor (DSP) to implement a real-time H.263+ codec. We use fast algorithms to reduce the codec computational complexity. Furthermore, the...
128
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Computer programs able to play different kinds of games (aka bots) is a growing area of interest for the computer game industry as the demand for better skilled computerized oppon...