Sciweavers

140 search results - page 16 / 28
» String Quartets In Binary
Sort
View
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
14 years 1 months ago
Efficient Processing of Updates in Dynamic XML Data
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
Changqing Li, Tok Wang Ling, Min Hu
SCCC
2002
IEEE
14 years 15 days ago
Improved Antidictionary Based Compression
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
Maxime Crochemore, Gonzalo Navarro
ICIP
2002
IEEE
14 years 9 months ago
Robust video text segmentation and recognition with multiple hypotheses
A method for segmenting and recognizing text embedded in video and images is proposed in this paper. In the method, multiple segmentation of the same text region is performed, thu...
Jean-Marc Odobez, Datong Chen
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 8 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CEC
2009
IEEE
14 years 2 months ago
Inertial geometric particle swarm optimization
— Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of a simplified form of traditional particle swarm optimization (PSO) without the i...
Alberto Moraglio, Julian Togelius