Sciweavers

2192 search results - page 118 / 439
» Algorithms for Challenging Motif Problems
Sort
View
COCOA
2009
Springer
14 years 2 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 1 months ago
Predicting Rare Events In Temporal Domains
Temporal data mining aims at finding patterns in historical data. Our work proposes an approach to extract temporal patterns from data to predict the occurrence of target events,...
Ricardo Vilalta, Sheng Ma
CVPR
2007
IEEE
14 years 10 months ago
Discriminant Mutual Subspace Learning for Indoor and Outdoor Face Recognition
Outdoor face recognition is among the most challenging problems for face recognition. In this paper, we develop a discriminant mutual subspace learning algorithm for indoor and ou...
Zhifeng Li, Dahua Lin, Helen M. Meng, Xiaoou Tang
PCM
2004
Springer
135views Multimedia» more  PCM 2004»
14 years 1 months ago
Probabilistic Face Tracking Using Boosted Multi-view Detector
Face tracking in realistic environments is a difficult problem due to pose variations, occlusions of objects, illumination changes and cluttered background, among others. The paper...
Peihua Li, Haijing Wang
ICAIL
2003
ACM
14 years 1 months ago
Induction of Defeasible Logic Theories in the Legal Domain
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
Benjamin Johnston, Guido Governatori