8825 search results - page 257 / 1765 » All for one or one for all |
125
Voted
HCI
2009
14 years 11 months ago
2009
The main goal of dialog management is to provide all information needed to perform e. g. a SQL-query, a navigation task, etc. Two principal approaches for dialog management systems...
115
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
106
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
105
click to vote
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
98
Voted
CIE
2010
Springer
15 years 5 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...