Sciweavers

87 search results - page 12 / 18
» How Large is the Set of Disjunctive Sequences
Sort
View
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 1 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
RECOMB
2005
Springer
14 years 7 months ago
Likely Scenarios of Intron Evolution
Whether common ancestors of eukaryotes and prokaryotes had introns is one of the oldest unanswered questions in molecular evolution. Recently completed genome sequences have been u...
Miklós Csürös
AAAI
2004
13 years 8 months ago
Self-Organizing Visual Maps
This paper deals with automatically learning the spatial distribution of a set of images. That is, given a sequence of images acquired from well-separated locations, how can they ...
Robert Sim, Gregory Dudek
ESANN
2004
13 years 8 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
APAL
2007
90views more  APAL 2007»
13 years 7 months ago
Guessing and non-guessing of canonical functions
It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary s...
David Asperó