7930 search results - page 1399 / 1586 » Greedy in Approximation Algorithms |
131
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
180
click to vote
GPC
2007
Springer
15 years 10 months ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
138
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
142
click to vote
ICB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...
130
click to vote
IH
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we describe a new forensic tool for revealing digitally altered images by detecting the presence of photo-response non-uniformity noise (PRNU) in small regions. This...