Sciweavers

870 search results - page 115 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
PAMI
2010
190views more  PAMI 2010»
14 years 8 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
SC
2004
ACM
15 years 3 months ago
A Performance and Scalability Analysis of the BlueGene/L Architecture
This paper is structured as follows. Section 2 gives an architectural description of BlueGene/L. Section 3 analyzes the issue of “computational noise” – the effect that the o...
Kei Davis, Adolfy Hoisie, Greg Johnson, Darren J. ...
PODC
2006
ACM
15 years 3 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
SPAA
2009
ACM
15 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
AUSDM
2008
Springer
225views Data Mining» more  AUSDM 2008»
14 years 12 months ago
Evaluation of Malware clustering based on its dynamic behaviour
Malware detection is an important problem today. New malware appears every day and in order to be able to detect it, it is important to recognize families of existing malware. Dat...
Ibai Gurrutxaga, Olatz Arbelaitz, Jesús M. ...