Sciweavers

4860 search results - page 136 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
14 years 10 months ago
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
Thomas Eiter, Georg Gottlob, Kazuhisa Makino
CIKM
2008
Springer
14 years 4 days ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
LION
2007
Springer
198views Optimization» more  LION 2007»
14 years 4 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 2 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
14 years 10 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu