4926 search results - page 383 / 986 » Two Graph Algorithms On an Associative Computing Model |
134
Voted
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
173
click to vote
EGH
2003
Springer
15 years 9 months ago
2003
Springer
We capitalize on recent advances in modern programmable graphics hardware, originally designed to support advanced local illumination models for shading, to instead perform two di...
232
click to vote
VLDB
2008
ACM
16 years 4 months ago
2008
ACM
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
131
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
145
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...