Sciweavers

337 search results - page 48 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
ICFP
2007
ACM
14 years 7 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
INFOCOM
2010
IEEE
13 years 6 months ago
Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
Kyunghan Lee, Yung Yi, Jaeseong Jeong, Hyungsuk Wo...
ICSM
2003
IEEE
14 years 25 days ago
Reverse Engineering of the Interaction Diagrams from C++ Code
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
Paolo Tonella, Alessandra Potrich
ICMLA
2008
13 years 9 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
TSP
2010
13 years 2 months ago
Improved dual decomposition based optimization for DSL dynamic spectrum management
Dynamic spectrum management (DSM) has been recognized as a key technology to significantly improve the performance of digital subscriber line (DSL) broadband access networks. The b...
Paschalis Tsiaflakis, Ion Necoara, Johan A. K. Suy...