Sciweavers

1964 search results - page 295 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
119
Voted
CIKM
2001
Springer
15 years 7 months ago
Automatic Discovery of Salient Segments in Imperfect Speech Transcripts
This paper addresses the problem of automatic detection of salient video segments for real-world applications such as corporate training based on associated speech transcriptions....
Dulce B. Ponceleon, Savitha Srinivasan
DBWORKSHOPS
1992
15 years 3 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
148
Voted
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
15 years 29 days ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
15 years 8 months ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler
DAC
2004
ACM
16 years 3 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...