2168 search results - page 135 / 434 » Randomized Algorithms and Complexity Theory |
131
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
145
Voted
CIE
2007
Springer
15 years 9 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
160
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
166
click to vote
VTC
2010
IEEE
15 years 1 months ago
2010
IEEE
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
120
click to vote
HICSS
2006
IEEE
15 years 9 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...