Sciweavers

1508 search results - page 255 / 302
» Efficient Path Profiling
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
SIGSOFT
2005
ACM
14 years 9 months ago
CUTE: a concolic unit testing engine for C
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
Koushik Sen, Darko Marinov, Gul Agha
WWW
2005
ACM
14 years 9 months ago
Popular web hot spots identification and visualization
This work aims a two-fold contribution: it presents a software to analyse logfiles and visualize popular web hot spots and, additionally, presents an algorithm to use this informa...
D. Avramouli, John D. Garofalakis, Dimitris J. Kav...
CC
2009
Springer
190views System Software» more  CC 2009»
14 years 9 months ago
SSA Elimination after Register Allocation
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
Fernando Magno Quintão Pereira, Jens Palsbe...
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
14 years 9 months ago
A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
Evangeline F. Y. Young, Chris C. N. Chu, M. L. Ho