Sciweavers

5473 search results - page 893 / 1095
» On the graph isomorphism problem
Sort
View
ICPP
2009
IEEE
15 years 4 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
CVPR
2011
IEEE
15 years 2 months ago
Biased Normalized Cuts
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
Subhransu Maji, Nisheeth Vishnoi, Jitendra Malik
CDC
2010
IEEE
272views Control Systems» more  CDC 2010»
15 years 1 months ago
Node capture attacks in wireless sensor networks: A system theoretic approach
In this paper we address the problem of physical node capture attacks in wireless sensor networks and provide a control theoretic framework to model physical node capture, cloned n...
Tamara Bonaci, Linda Bushnell, Radha Poovendran
COLING
2010
15 years 1 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
DCC
2011
IEEE
15 years 1 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev