74 search results - page 7 / 15 » Algorithms for Generating Convex Sets in Acyclic Digraphs |
119
Voted
ACCV
2010
Springer
14 years 7 months ago
2010
Springer
We propose a novel variational formulation for generating 3D models of objects from a single view. Based on a few user scribbles in an image, the algorithm automatically extracts t...
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
105
Voted
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
130
Voted
ACCV
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
136
click to vote
ISPAN
2002
IEEE
15 years 5 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...