Sciweavers

2693 search results - page 359 / 539
» On Computing Complex Navigation Functions
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 10 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
FOCS
1999
IEEE
15 years 10 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
BMCBI
2006
158views more  BMCBI 2006»
15 years 6 months ago
Parallelization of multicategory support vector machines (PMC-SVM) for classifying microarray data
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
Chaoyang Zhang, Peng Li, Arun Rajendran, Youping D...
BMCBI
2006
133views more  BMCBI 2006»
15 years 6 months ago
Web-based analysis of the mouse transcriptome using Genevestigator
Background: Gene function analysis often requires a complex and laborious sequence of laboratory and computer-based experiments. Choosing an effective experimental design generall...
Oliver Laule, Matthias Hirsch-Hoffmann, Tomas Hruz...