Sciweavers

2095 search results - page 53 / 419
» Improved pebbling bounds
Sort
View
3DIM
2005
IEEE
15 years 5 months ago
Discrete Pose Space Estimation to Improve ICP-Based Tracking
Iterative Closest Point (ICP) -based tracking works well when the interframe motion is within the ICP minimum well space. For large interframe motions resulting from a limited sen...
Limin Shang, Piotr Jasiobedzki, Michael A. Greensp...
NIPS
2008
15 years 1 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
15 years 1 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 6 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
AOR
2007
107views more  AOR 2007»
14 years 12 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...