Sciweavers

4131 search results - page 41 / 827
» Compactness in Topology and Computation
Sort
View
4OR
2007
103views more  4OR 2007»
15 years 2 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti
CIARP
2010
Springer
15 years 26 days ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata
PPOPP
2003
ACM
15 years 7 months ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
SPAA
2003
ACM
15 years 7 months ago
Compact routing with name independence
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan...
NPAR
2010
ACM
15 years 7 months ago
Compact explosion diagrams
This paper presents a system to automatically generate compact explosion diagrams. Inspired by handmade illustrations, our approach reduces the complexity of an explosion diagram ...
Markus Tatzgern, Denis Kalkofen, Dieter Schmalstie...