5138 search results - page 418 / 1028 » Randomized Algorithms for 3-SAT |
177
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
243
click to vote
GECCO
2003
Springer
16 years 17 hour ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
191
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
188
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: The previous studies of genome-wide expression patterns show that a certain percentage of genes are cell cycle regulated. The expression data has been analyzed in a nu...
171
click to vote
CCE
2004
15 years 6 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...