Sciweavers

3406 search results - page 508 / 682
» Computational models of classical conditioning
Sort
View
COCOON
2005
Springer
15 years 11 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
WABI
2005
Springer
107views Bioinformatics» more  WABI 2005»
15 years 11 months ago
Linear Time Algorithm for Parsing RNA Secondary Structure
Abstract Baharak Rastegari and Anne Condon Department of Computer Science, University of British Columbia Abstract. Accurate prediction of pseudoknotted RNA secondary structure is ...
Baharak Rastegari, Anne Condon
SAC
2004
ACM
15 years 11 months ago
Interval and dynamic time warping-based decision trees
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
Juan José Rodríguez, Carlos J. Alons...
SIGECOM
2004
ACM
86views ECommerce» more  SIGECOM 2004»
15 years 11 months ago
Mechanisms for a spatially distributed market
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...
Moshe Babaioff, Noam Nisan, Elan Pavlov
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
15 years 10 months ago
Scalable Model-based Clustering by Working on Data Summaries
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
Huidong Jin, Man Leung Wong, Kwong-Sak Leung