7380 search results - page 1341 / 1476 » time 2008 |
143
click to vote
TIT
2008
15 years 4 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
137
click to vote
IVS
2007
15 years 4 months ago
2007
During the last two decades, a wide variety of advanced methods for the visual exploration of large data sets have been proposed. For most of these techniques user interaction has...
151
click to vote
JACM
2007
15 years 4 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
130
Voted
JAIR
2007
15 years 4 months ago
2007
In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical model...
141
click to vote
JALC
2007
15 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...