676 search results - page 112 / 136 » Sub-stochastic matrix analysis for bounds computation - Theo... |
KDD
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
The need for empirical evaluation metrics and algorithms is well acknowledged in the field of computer vision. The process leads to precise insights to understanding current techn...
SIGGRAPH
1995
ACM
13 years 11 months ago
1995
ACM
In this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity. The new method ensures that just enough work is done to meet th...
ISVC
2010
Springer
13 years 5 months ago
2010
Springer
Large, multidimensional datasets are difficult to visualize and analyze. Visualization interfaces are constrained in resolution and dimension, so cluttering and problems of project...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...