Sciweavers

3136 search results - page 592 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ML
2008
ACM
14 years 11 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
EOR
2007
102views more  EOR 2007»
14 years 11 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
EOR
2007
73views more  EOR 2007»
14 years 11 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...
PRL
2008
142views more  PRL 2008»
14 years 11 months ago
Highly accurate error-driven method for noun phrase detection
We present a new model for detection of noun phrases in unrestricted text, whose most outstanding feature is its flexibility: the system is able to recognize noun phrases similar ...
Lourdes Araujo, Jose Ignacio Serrano
PAMI
2006
206views more  PAMI 2006»
14 years 11 months ago
MILES: Multiple-Instance Learning via Embedded Instance Selection
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called...
Yixin Chen, Jinbo Bi, James Ze Wang