2080 search results - page 134 / 416 » Measuring empirical computational complexity |
148
click to vote
AMFG
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper addresses the recovery of face models from stereo pairs of images in the presence of foreign-body occlusions. In the proposed approach, a 3D morphable model (3DMM) for f...
147
click to vote
SC
1995
ACM
15 years 8 months ago
1995
ACM
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates...
100
click to vote
PNPM
1989
15 years 8 months ago
1989
We present SPNP, a powerful GSPN package developed at Duke University. SPNP allows the modeling of complex system behaviors. Advanced constructs are available, such as markingdepe...
174
click to vote
TNN
2010
14 years 11 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
141
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...