267 search results - page 28 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
ICPP
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
CSC
2006
13 years 10 months ago
2006
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
BMCBI
2010
13 years 8 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
IJCNN
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—Acquisition and representation of semantic concepts is a necessary requirement for the understanding of natural languages by cognitive systems. Word games provide an int...