Sciweavers

16513 search results - page 3267 / 3303
» Numerical Analysis Methods
Sort
View
IOR
2006
177views more  IOR 2006»
13 years 8 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
ISI
2006
Springer
13 years 8 months ago
Measures to Detect Word Substitution in Intercepted Communication
Abstract. Those who want to conceal the content of their communications can do so by replacing words that might trigger attention by other words or locutions that seem more ordinar...
SzeWang Fong, David B. Skillicorn, Dmitri Roussino...
ISI
2006
Springer
13 years 8 months ago
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...
Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tib&...
IVC
2006
187views more  IVC 2006»
13 years 8 months ago
Dynamics of facial expression extracted automatically from video
We present a systematic comparison of machine learning methods applied to the problem of fully automatic recognition of facial expressions, including AdaBoost, support vector mach...
Gwen Littlewort, Marian Stewart Bartlett, Ian R. F...
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
« Prev « First page 3267 / 3303 Last » Next »