Sciweavers

1068 search results - page 126 / 214
» Extremely randomized trees
Sort
View
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 11 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
INFOCOM
2010
IEEE
13 years 8 months ago
Reliable Wireless Broadcasting with Near-Zero Feedback
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
Weiyao Xiao, Sachin Agarwal, David Starobinski, Ar...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 4 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
ICIP
2006
IEEE
14 years 4 months ago
MRF Modeling for Optical Flow Computation from Multi-Structure Objects
We propose in this paper a new formulation of the equation of the optical flow enabling to compute global and local motions of multi-structure objects (flowers and petals, trees...
Véronique Prinet, Cyril Cassisa, FengFeng T...
SDMW
2004
Springer
14 years 3 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker