Sciweavers

2042 search results - page 344 / 409
» Variable Number of
Sort
View
82
Voted
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
15 years 11 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
92
Voted
CIKM
2007
Springer
15 years 5 months ago
Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases
We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Sema...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
CORR
2006
Springer
125views Education» more  CORR 2006»
14 years 11 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 8 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
107
Voted
JMLR
2011
111views more  JMLR 2011»
14 years 5 months ago
Models of Cooperative Teaching and Learning
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
Sandra Zilles, Steffen Lange, Robert Holte, Martin...