873 search results - page 14 / 175 » step 2005 |
101
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
STEP
2005
IEEE
15 years 5 months ago
2005
IEEE
While the use of test-driven development as a debugging, pedagogic, and analytical methodology for objectoriented and procedural systems is well documented, it is a relatively une...
ISCAS
2005
IEEE
15 years 5 months ago
2005
IEEE
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
118
click to vote
ITCC
2005
IEEE
15 years 5 months ago
2005
IEEE
Density-based clustering algorithms have recently gained popularity in the data mining field due to their ability to discover arbitrary shaped clusters while preserving spatial pr...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...