Sciweavers

654 search results - page 118 / 131
» Ordered Sets and Complete Lattices
Sort
View
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
13 years 11 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
CSFW
2010
IEEE
13 years 10 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson
SIROCCO
2007
13 years 9 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
UAI
2004
13 years 9 months ago
Probabilistic Index Maps for Modeling Natural Signals
One of the major problems in modeling natural signals is that signals with very similar structure may locally have completely different measurements, e.g., images taken under diff...
Nebojsa Jojic, Yaron Caspi, Manuel Reyes-Gomez
WOB
2003
129views Bioinformatics» more  WOB 2003»
13 years 9 months ago
Procsimo: uma Ferramenta de Procura de Similaridade entre Operons
In this work, we propose a software tool, called PROCSIMO, which aims the identification of similarities between operons in bacterial genomes. From a database which contains the ch...
Carlos Azevedo, Alexandre Plastino, Ana Tereza R. ...