Sciweavers

4526 search results - page 82 / 906
» Algorithmic problems related to the Internet
Sort
View
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 4 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
TCSV
2008
202views more  TCSV 2008»
15 years 3 months ago
Probabilistic Object Tracking With Dynamic Attributed Relational Feature Graph
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
Feng Tang, Hai Tao
TIT
2008
83views more  TIT 2008»
15 years 3 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
CIMAGING
2009
265views Hardware» more  CIMAGING 2009»
15 years 5 months ago
Multi-object segmentation using coupled nonparametric shape and relative pose priors
We present a new method for multi-object segmentation in a maximum a posteriori estimation framework. Our method is motivated by the observation that neighboring or coupling objec...
Mustafa Gökhan Uzunbas, Octavian Soldea, M&uu...
131
Voted
DCC
2002
IEEE
16 years 3 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr