232 search results - page 30 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
FGR
2006
IEEE
14 years 1 months ago
2006
IEEE
While there has been a great deal of research in face detection and recognition, there has been very limited work on identifying the expression on a face. Many current face detect...
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
CACM
1998
13 years 7 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
IPPS
2005
IEEE
14 years 29 days ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
CF
2007
ACM
13 years 11 months ago
2007
ACM
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...