Sciweavers

16596 search results - page 208 / 3320
» Generalized Assignment Problems
Sort
View
130
Voted
CVPR
2009
IEEE
16 years 9 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
104
Voted
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
15 years 12 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
114
Voted
EICS
2009
ACM
15 years 9 months ago
How usable are operational digital libraries: a usability evaluation of system interactions
This paper reports a usability evaluation of three operational digital libraries (DLs): the ACM DL, the IEEE Computer Society DL, and the IEEE Xplore DL. An experiment was conduct...
Xiangmin Zhang, Jingjing Liu, Yuelin Li, Ying Zhan...
122
Voted
SC
2000
ACM
15 years 7 months ago
Scalable Algorithms for Adaptive Statistical Designs
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
Robert H. Oehmke, Janis Hardwick, Quentin F. Stout
117
Voted
ATAL
2006
Springer
15 years 6 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara