Sciweavers

2520 search results - page 150 / 504
» The complexity of approximating entropy
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 6 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
ACL
2006
15 years 5 months ago
Approximation Lasso Methods for Language Modeling
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
Jianfeng Gao, Hisami Suzuki, Bin Yu
AAAI
1997
15 years 5 months ago
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
Frank Klassner, Victor R. Lesser, Hamid Nawab
CVIU
2010
89views more  CVIU 2010»
15 years 4 months ago
Spherical approximation for multiple cameras in motion estimation: Its applicability and advantages
Estimating motions of a multi-camera system which may not have overlapping fields of view is generally complex and computationally expensive because of the non-zero offset between...
Jun-Sik Kim, Myung Hwangbo, Takeo Kanade
JSCIC
2007
89views more  JSCIC 2007»
15 years 4 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa