1772 search results - page 139 / 355 » Classifying Problems into Complexity Classes |
169
click to vote
ICALP
2007
Springer
16 years 18 days ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
178
click to vote
CRV
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
152
click to vote
GLOBECOM
2007
IEEE
16 years 23 days ago
2007
IEEE
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
195
click to vote
CCR
2006
15 years 6 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...