Sciweavers

1208 search results - page 64 / 242
» Uniform eventown problems
Sort
View
95
Voted
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 10 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
WWW
2011
ACM
14 years 5 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
79
Voted
ICIP
2008
IEEE
15 years 12 months ago
LASIC: A model invariant framework for correspondence
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
Bernardo Rodrigues Pires, João Xavier, Jos&...
90
Voted
IEAAIE
2003
Springer
15 years 3 months ago
A Rigorous Approach to Knowledge Base Maintenance
A knowledge base is maintained by modifying its conceptual model and by using those modifications to specify changes to its implementation. The maintenance problem is to determine ...
John K. Debenham
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
15 years 2 months ago
A constant-factor approximately optimal solution to the Witsenhausen counterexample
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
Se Yong Park, Pulkit Grover, Anant Sahai