Sciweavers

2917 search results - page 554 / 584
» Satisfying Interaction Constraints
Sort
View
AAAI
2011
12 years 7 months ago
Quantity Makes Quality: Learning with Partial Views
In many real world applications, the number of examples to learn from is plentiful, but we can only obtain limited information on each individual example. We study the possibiliti...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CVPR
2007
IEEE
14 years 9 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
SIGSOFT
2003
ACM
14 years 8 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 8 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
ATAL
2007
Springer
14 years 1 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee