Sciweavers

216 search results - page 19 / 44
» Fast Optimal Algorithms for Computing All the Repeats in a S...
Sort
View
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
14 years 3 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic
CGI
2000
IEEE
14 years 1 months ago
SQUEEZE: Fast and Progressive Decompression of Triangle Meshes
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (...
Renato Pajarola, Jarek Rossignac
ICIP
2009
IEEE
14 years 9 months ago
Fast Block Based Connected Components Labeling
In this paper we present a new optimization technique for the neighborhood computation in connected component labeling focused on images stored in raster scan order. This new tech...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 9 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
RECOMB
2002
Springer
14 years 9 months ago
Comparison of minisatellites
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
Eric Rivals, Sèverine Bérard