Sciweavers

2698 search results - page 304 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
ACL
1997
15 years 8 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
ICML
2006
IEEE
16 years 7 months ago
A statistical approach to rule learning
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
Stefan Kramer, Ulrich Rückert
LATIN
2010
Springer
16 years 1 months ago
Minimum-Perimeter Intersecting Polygons
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
Adrian Dumitrescu, Minghui Jiang
ICML
2010
IEEE
15 years 7 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
16 years 6 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...