Sciweavers

15073 search results - page 379 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
DATE
2004
IEEE
116views Hardware» more  DATE 2004»
15 years 9 months ago
A Novel SAT All-Solutions Solver for Efficient Preimage Computation
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...
Bin Li, Michael S. Hsiao, Shuo Sheng
FSTTCS
2007
Springer
16 years 5 days ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...
TASLP
2010
109views more  TASLP 2010»
15 years 4 months ago
Model-Based Expectation-Maximization Source Separation and Localization
Abstract—This paper describes a system, referred to as modelbased expectation-maximization source separation and localization (MESSL), for separating and localizing multiple soun...
Michael I. Mandel, Ron J. Weiss, Daniel P. W. Elli...
KDD
2009
ACM
219views Data Mining» more  KDD 2009»
16 years 6 months ago
Structured correspondence topic models for mining captioned figures in biological literature
A major source of information (often the most crucial and informative part) in scholarly articles from scientific journals, proceedings and books are the figures that directly pro...
Amr Ahmed, Eric P. Xing, William W. Cohen, Robert ...
RSCTC
2000
Springer
151views Fuzzy Logic» more  RSCTC 2000»
15 years 9 months ago
Anytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
Mark Last, Abraham Kandel, Oded Maimon, Eugene Ebe...