14078 search results - page 2248 / 2816 » Design and Analysis of Computer Algorithms |
177
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
211
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
— In the last decade, face analysis, e.g. face recognition, face detection, face tracking and facial expression recognition, is a very lively and expanding research field. As com...
165
click to vote
SKG
2006
IEEE
16 years 1 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
220
click to vote
SMI
2006
IEEE
16 years 1 months ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
189
click to vote
SAC
2006
ACM
16 years 1 months ago
2006
ACM
Templates in web sites hurt search engine retrieval performance, especially in content relevance and link analysis. Current template removal methods suffer from processing speed ...