Sciweavers

7129 search results - page 773 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICLP
2007
Springer
16 years 29 days ago
Automatic Binding-Related Error Diagnosis in Logic Programs
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
Pawel Pietrzak, Manuel V. Hermenegildo
CVPR
2006
IEEE
16 years 26 days ago
A Generalized EM Approach for 3D Model Based Face Recognition under Occlusions
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...
Michael De Smet, Rik Fransens, Luc J. Van Gool
INFOCOM
2005
IEEE
16 years 12 days ago
Achieving minimum-cost multicast: a decentralized approach based on network coding
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...
SAC
2005
ACM
16 years 11 days ago
Performance evaluation for text processing of noisy inputs
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
Daniel P. Lopresti
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 11 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia