7006 search results - page 509 / 1402 » Approximation Algorithms |
181
click to vote
ICCV
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper presents a framework for implicit deformable models and a pair of new algorithms for solving the nonlinear partial di erential equations that result from this framework...
184
click to vote
CCE
2004
15 years 6 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
237
click to vote
OOPSLA
2000
Springer
15 years 10 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
146
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
175
click to vote
LCN
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...