Sciweavers

4377 search results - page 102 / 876
» Mass problems and randomness
Sort
View
CVPR
2005
IEEE
16 years 7 months ago
Diagram Structure Recognition by Bayesian Conditional Random Fields
Hand-drawn diagrams present a complex recognition problem. Elements of the diagram are often individually ambiguous, and require context to be interpreted. We present a recognitio...
Yuan (Alan) Qi, Martin Szummer, Thomas P. Minka
ICPR
2004
IEEE
16 years 6 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 9 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
JC
2006
115views more  JC 2006»
15 years 5 months ago
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
We study the problem of multivariate integration on the unit cube for unbounded integrands. Our study is motivated by problems in statistics and mathematical finance, where unboun...
Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Slo...
159
Voted
CRYPTO
2006
Springer
104views Cryptology» more  CRYPTO 2006»
15 years 9 months ago
Random Selection with an Adversarial Majority
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman