620 search results - page 60 / 124 » A Simple and Fast Min-cut Algorithm |
TIP
2011
14 years 6 months ago
2011
Abstract—Image reconstruction from its projections is a necessity in many applications such as medical (CT), security, inspection, and others. This paper extends the 2-D Fan-beam...
GD
2007
Springer
15 years 6 months ago
2007
Springer
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
108
click to vote
ICDM
2006
IEEE
2006
IEEE
Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets
15 years 5 months ago
In many clustering applications for bioinformatics, only part of the data clusters into one or more groups while the rest needs to be pruned. For such situations, we present Hiera...
AIPS
2010
15 years 2 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...