242 search results - page 12 / 49 » Object-level Vertical Search |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
AE
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
COCOA
2011
Springer
12 years 7 months ago
2011
Springer
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
INFOVIS
2005
IEEE
14 years 1 months ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
AAECC
2009
Springer
14 years 2 months ago
2009
Springer
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...