Sciweavers

966 search results - page 143 / 194
» A Two-Level Learning Method for Generalized Multi-instance P...
Sort
View
129
Voted
CP
2006
Springer
15 years 6 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
85
Voted
AAAI
1998
15 years 3 months ago
Feature Generation for Sequence Categorization
The problem of sequence categorization is to generalize from a corpus of labeled sequences procedures for accurately labeling future unlabeled sequences. The choice of representat...
Daniel Kudenko, Haym Hirsh
113
Voted
ACL
1998
15 years 3 months ago
Some Properties of Preposition and Subordinate Conjunction Attachments
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
Alexander S. Yeh, Marc B. Vilain
AOSD
2009
ACM
15 years 10 days ago
Concept analysis for product line requirements
Traditional methods characterize a software product line's requirements using either functional or quality criteria. This appears to be inadequate to assess modularity, detec...
Nan Niu, Steve M. Easterbrook
132
Voted
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 2 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims