8496 search results - page 379 / 1700 » Problem Solving and Complex Systems |
167
click to vote
AGILEDC
2007
IEEE
16 years 1 months ago
2007
IEEE
A complex Enterprise Relationship Planning (ERP) data migration was in trouble: low quality, poor performance, instability, and an overworked team threatened project success. Faci...
155
click to vote
CPM
2003
Springer
16 years 7 hour ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
143
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
151
Voted
SIAMJO
2008
15 years 6 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
173
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...