Sciweavers

301 search results - page 38 / 61
» Narrowing Directed by a Graph of Terms
Sort
View
WWW
2004
ACM
14 years 8 months ago
Propagation of trust and distrust
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan...
ACCV
2009
Springer
14 years 2 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
SAFECOMP
2005
Springer
14 years 1 months ago
Control and Data Flow Testing on Function Block Diagrams
As programmable logic controllers(PLCs) have been used in safety-critical applications, testing of PLC applications has become important. The previous PLC-based software testing te...
Eunkyoung Jee, Junbeom Yoo, Sung Deok Cha
SPAA
2010
ACM
14 years 13 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze