Sciweavers

846 search results - page 29 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
ICSM
2007
IEEE
14 years 1 months ago
Computation of Static Execute After Relation with Applications to Software Maintenance
In this paper, we introduce Static Execute After (SEA) relationship among program components and present an efficient analysis algorithm. Our case studies show that SEA may appro...
Árpád Beszédes, Tamás ...
JGAA
2000
179views more  JGAA 2000»
13 years 7 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
CAD
2006
Springer
13 years 7 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
ALGORITHMICA
2011
13 years 2 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
VIS
2008
IEEE
175views Visualization» more  VIS 2008»
14 years 8 months ago
Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields
We present a novel approach for the direct computation of integral surfaces in general vector fields. As opposed to previous work, which we analyze in detail, our approach is based...
Christoph Garth, Hari Krishnan, Xavier Tricoche,...