Sciweavers

307 search results - page 4 / 62
» A Comparison of Algorithms for Connected Set Openings and Cl...
Sort
View
IEEECIT
2010
IEEE
13 years 5 months ago
Adaptive Algorithms for Efficient Content Management in Social Network Services
Identifying the set of resources that are expected to receive the majority of requests in the near future, namely hot set, is at the basis of most content management strategies of...
Claudia Canali, Michele Colajanni, Riccardo Lancel...
COMSWARE
2007
IEEE
14 years 1 months ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...
IPPS
2010
IEEE
13 years 5 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
ICIP
2009
IEEE
13 years 5 months ago
Automatic closed eye correction
On a large group picture, having all people open their eyes can turn out to be a difficult task for photographers. Therefore, in this paper, we describe an original method to auto...
Jean Charles Bazin, Dang-Quang Pham, Inso Kweon, K...
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 5 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...