302 search results - page 32 / 61 » Efficient Algorithms for the Longest Path Problem |
132
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
113
Voted
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
261
Voted
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
123
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
118
click to vote
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...