Sciweavers

6142 search results - page 606 / 1229
» The Complexity of Partition Functions
Sort
View
ICML
2007
IEEE
16 years 8 months ago
Linear and nonlinear generative probabilistic class models for shape contours
We introduce a robust probabilistic approach to modeling shape contours based on a lowdimensional, nonlinear latent variable model. In contrast to existing techniques that use obj...
Graham McNeill, Sethu Vijayakumar
HICSS
2010
IEEE
210views Biometrics» more  HICSS 2010»
16 years 2 months ago
The Effects of Linguistic Features and Evaluation Perspective on Perceived Difficulty of Medical Text
Millions of laypersons need more medical information than they are customarily provided during their doctor’s visit. Health websites can help fill this knowledge gap, but the te...
Gondy Leroy, Stephen Helmreich, James R. Cowie
ICCS
2009
Springer
16 years 1 months ago
Modular, Fine-Grained Adaptation of Parallel Programs
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
Pilsung Kang 0002, Naresh K. C. Selvarasu, Naren R...
SAFECOMP
2009
Springer
16 years 1 months ago
Establishing a Framework for Dynamic Risk Management in 'Intelligent' Aero-Engine Control
The behaviour of control functions in safety critical software systems is typically bounded to prevent the occurrence of known system level hazards. These bounds are typically deri...
Zeshan Kurd, Tim Kelly, John A. McDermid, Radu Cal...
SAT
2009
Springer
153views Hardware» more  SAT 2009»
16 years 1 months ago
Does Advice Help to Prove Propositional Tautologies?
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
Olaf Beyersdorff, Sebastian Müller