2498 search results - page 244 / 500 » Data Structures with Unpredictable Timing |
115
click to vote
PR
2006
15 years 2 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
142
Voted
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...
109
Voted
ICDM
2010
IEEE
15 years 17 days ago
2010
IEEE
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
122
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
126
Voted
EUC
2008
Springer
15 years 4 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...