Sciweavers

658 search results - page 106 / 132
» Solution of the Train Platforming Problem
Sort
View
JMLR
2006
169views more  JMLR 2006»
13 years 8 months ago
Bayesian Network Learning with Parameter Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
PAMI
2007
249views more  PAMI 2007»
13 years 8 months ago
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
— The traditional image representations are not suited to conventional classification methods, such as the linear discriminant analysis (LDA), because of the under sample problem...
Dacheng Tao, Xuelong Li, Xindong Wu, Stephen J. Ma...
MEMOCODE
2007
IEEE
14 years 2 months ago
MEMOCODE 2007 Co-Design Contest
New to the 2007 MEMOCODE conference is the HW/SW Co-Design Contest. Members of the technical and steering committees from MEMOCODE 2006 thought that the co-design practice is dist...
Forrest Brewer, James C. Hoe
HICSS
2003
IEEE
125views Biometrics» more  HICSS 2003»
14 years 1 months ago
Applying a Layered Policy Model to IP Based Voice Services
Traditionally, specific telecommunications services were essentially confined to certain types of networks; e.g., television over broadcast networks or cable and voice service ove...
Douglas C. Sicker
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 1 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...