Sciweavers

2834 search results - page 227 / 567
» Representing Trees with Constraints
Sort
View
IJCAI
1997
15 years 8 months ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh
ANOR
2008
171views more  ANOR 2008»
15 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
COLING
2002
15 years 6 months ago
Location Normalization for Information Extraction
Ambiguity is very high for location names. For example, there are 23 cities named `Buffalo' in the U.S. Country names such as `Canada', `Brazil' and `China' ar...
Huifeng Li, Rohini K. Srihari, Cheng Niu, Wei Li 0...
SAT
2010
Springer
127views Hardware» more  SAT 2010»
15 years 4 months ago
Symmetry and Satisfiability: An Update
Abstract. The past few years have seen significant progress in algorithms and heuristics for both SAT and symmetry detection. Additionally, the thesis that some of SAT's intra...
Hadi Katebi, Karem A. Sakallah, Igor L. Markov
CVPR
2006
IEEE
16 years 8 months ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton