5624 search results - page 790 / 1125 » On Conditional Covering Problem |
144
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
120
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
126
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
140
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
130
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper, we survey the current state-ofart models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron...