1480 search results - page 94 / 296 » Distributed algorithms for weighted problems in sparse graph... |
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
WADS
2001
Springer
14 years 3 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
APPROX
2005
Springer
14 years 4 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
GFKL
2005
Springer
14 years 4 months ago
2005
Springer
In classification, with an increasing number of variables, the required number of observations grows drastically. In this paper we present an approach to put into effect the maxi...
ICIP
2006
IEEE
15 years 9 days ago
2006
IEEE
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...