4377 search results - page 107 / 876 » Mass problems and randomness |
145
click to vote
CPC
2006
15 years 5 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
144
click to vote
EOR
2006
15 years 5 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
203
click to vote
CVPR
2009
IEEE
17 years 19 days ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...
127
click to vote
CADE
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
145
click to vote
DCC
2004
IEEE
16 years 5 months ago
2004
IEEE
We present a statistical optimization framework for solving the end-to-end problem of progressive transmission of images over noisy channels. We consider the impacts of transmissi...