Sciweavers

861 search results - page 76 / 173
» Faster integer multiplication
Sort
View
DKE
2007
95views more  DKE 2007»
13 years 10 months ago
Warping the time on data streams
Continuously monitoring through time the correlation/distance of multiple data streams is of interest in a variety of applications, including financial analysis, video surveillanc...
Paolo Capitani, Paolo Ciaccia
ICIP
2009
IEEE
13 years 8 months ago
Text segmentation in natural scenes using Toggle-Mapping
We offer, in this paper, a new method to segment text in natural scenes. This method is based on the use of a morphological operator: the Toggle Mapping. The efficiency of the met...
Jonathan Fabrizio, Beatriz Marcotegui, Matthieu Co...
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 4 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
ICCS
2007
Springer
14 years 4 months ago
Impact of QoS on Replica Placement in Tree Networks
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, wh...
Anne Benoit, Veronika Rehn, Yves Robert
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
14 years 3 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...