5046 search results - page 826 / 1010 » Non-redundant data clustering |
178
click to vote
COCOON
2005
Springer
16 years 23 days ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
257
click to vote
ICN
2005
Springer
16 years 22 days ago
2005
Springer
: Power Conservation is one of the most important challenges in wireless sensor networks. In this paper, we present two minimum-energy routing algorithms. Our main goal is to reduc...
209
click to vote
KDD
2005
ACM
16 years 21 days ago
2005
ACM
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
200
click to vote
PAKDD
2004
ACM
16 years 17 days ago
2004
ACM
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
209
click to vote
PDP
2010
IEEE
16 years 16 days ago
2010
IEEE
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...