Sciweavers

3373 search results - page 123 / 675
» Linear transformations on codes
Sort
View
128
Voted
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
15 years 7 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo
ECOOP
2007
Springer
15 years 7 months ago
Automation of Refactoring and Refactoring Suggestions for TTCN-3 Test Suites. The TRex TTCN-3 Refactoring and Metrics Tool
Refactoring is not only useful for source code of implementations, but as well for test specifications. The open source TRex tool automates the application of refactorings and the ...
Helmut Neukirchen, Benjamin Zeiss
143
Voted
TREC
2001
15 years 4 months ago
Tampere University of Technology at TREC 2001
In this paper we present the prototype based text matching methodology used in the Routing Sub-Task of TREC 2001 Filtering Track. The methodology examines texts on word and senten...
Ari Visa, Jarmo Toivonen, Tomi Vesanen, Jarno M&au...
IPPS
2010
IEEE
15 years 1 months ago
DynTile: Parametric tiled loop generation for parallel execution on multicore processors
Abstract--Loop tiling is an important compiler transformation used for enhancing data locality and exploiting coarsegrained parallelism. Tiled codes in which tile sizes are runtime...
Albert Hartono, Muthu Manikandan Baskaran, J. Rama...
CODES
2005
IEEE
15 years 9 months ago
An integer linear programming approach for identifying instruction-set extensions
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...