Sciweavers

2994 search results - page 413 / 599
» Time sequences
Sort
View
143
Voted
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
15 years 9 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
99
Voted
SIGCOMM
1997
ACM
15 years 7 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker
157
Voted
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 4 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
145
Voted
BMCBI
2008
106views more  BMCBI 2008»
15 years 3 months ago
An Integrated Korean Biodiversity and Genetic Information Retrieval System
Background: On-line biodiversity information databases are growing quickly and being integrated into general bioinformatics systems due to the advances of fast gene sequencing tec...
Jeongheui Lim, Jong Bhak, Hee-Mock Oh, Chang-Bae K...
140
Voted
BMCBI
2007
177views more  BMCBI 2007»
15 years 3 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni