Sciweavers

4488 search results - page 81 / 898
» Properties of NP-Complete Sets
Sort
View
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
14 years 1 months ago
Are Cook and Karp Ever the Same?
We consider the question whether there exists a set A such that every set polynomial-time Turing equivalent to A is also many-one equivalent to A. We show that if E = NE then no s...
Richard Beigel, Lance Fortnow
ISCIS
2003
Springer
14 years 1 months ago
A New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
Hamid Beigy, Mohammad Reza Meybodi
LPNMR
2009
Springer
14 years 18 days ago
On Reductive Semantics of Aggregates in Answer Set Programming
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
Joohyung Lee, Yunsong Meng
20
Voted
FLAIRS
2001
13 years 9 months ago
Tracking Clusters in Evolving Data Sets
As organizations accumulate data over time, the problem of tracking how patterns evolve becomes important. In this paper, we present an algorithm to track the evolution of cluster...
Daniel Barbará, Ping Chen
DAGSTUHL
2009
13 years 9 months ago
Median Topographic Maps for Biomedical Data Sets
Abstract. Median clustering extends popular neural data analysis methods such as the self-organizing map or neural gas to general data structures given by a dissimilarity matrix on...
Barbara Hammer, Alexander Hasenfuss, Fabrice Rossi