Sciweavers

7129 search results - page 800 / 1426
» Approximation Algorithms for Treewidth
Sort
View
COLT
1991
Springer
15 years 10 months ago
Learning Probabilistic Read-Once Formulas on Product Distributions
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
Robert E. Schapire
AAAI
2008
15 years 8 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
ASPDAC
2005
ACM
96views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Comprehensive frequency dependent interconnect extraction and evaluation methodology
Abstract— Frequency dependent interconnect analysis is challenging since lumped equivalent circuit models extracted at different frequencies exhibit distinct time and frequency d...
Rong Jiang, Charlie Chung-Ping Chen
CVPR
2008
IEEE
15 years 8 months ago
Photometric stereo with coherent outlier handling and confidence estimation
In photometric stereo a robust method is required to deal with outliers, such as shadows and non-Lambertian reflections. In this paper we rely on a probabilistic imaging model tha...
Frank Verbiest, Luc J. Van Gool
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 8 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau