4377 search results - page 103 / 876 » Mass problems and randomness |
150
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
136
click to vote
IOR
2010
15 years 4 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
275
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
Abstract-- We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing alg...
155
click to vote
IJCNN
2006
IEEE
15 years 11 months ago
2006
IEEE
— A heuristic is proposed to address free parameter selection for Support Vector Machines, with the goals of improving generalization performance and providing greater insensitiv...
133
click to vote
PG
2003
IEEE
15 years 10 months ago
2003
IEEE
Making virtual modeling as easy and intuitive as realclay manipulation is still an unsolved problem. This paper takes a step in this direction: in addition to offering standard fe...