4198 search results - page 70 / 840 » In search of lost time |
155
click to vote
EVOW
2007
Springer
16 years 1 days ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
165
click to vote
CPM
2001
Springer
15 years 10 months ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
177
click to vote
ACSC
2004
IEEE
15 years 9 months ago
2004
IEEE
Given the rate of growth of the Web, scalability of search engines is a key issue, as the amount of hardware and network resources needed is large, and expensive. In addition, sea...
161
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
The aim of this work is to propose an adaptation of optimal path based interactive tools for image segmentation (related to Live-Wire [12] and Intelligent Scissors [18] approaches)...
168
click to vote
IWOMP
2009
Springer
16 years 12 days ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...