272 search results - page 6 / 55 » Minimal Function Graphs are not Instrumented |
GD
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
DM
2006
13 years 11 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
GLOBECOM
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
ECCV
2008
Springer
14 years 18 days ago
2008
Springer
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...