Sciweavers

601 search results - page 113 / 121
» Edge-dominating cycles in graphs
Sort
View
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 2 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of v...
John E. Hopcroft, Daniel Sheldon
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 2 months ago
Pre-synthesis optimization of multiplications to improve circuit performance
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially i...
Rafael Ruiz-Sautua, María C. Molina, Jos&ea...
DATE
2005
IEEE
171views Hardware» more  DATE 2005»
14 years 2 months ago
Access Pattern-Based Code Compression for Memory-Constrained Embedded Systems
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...
Ozcan Ozturk, Hendra Saputra, Mahmut T. Kandemir, ...
GD
2005
Springer
14 years 2 months ago
A Mixed-Integer Program for Drawing High-Quality Metro Maps
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
Martin Nöllenburg, Alexander Wolff
SLIP
2003
ACM
14 years 1 months ago
Fast estimation of the partitioning rent characteristic using a recursive partitioning model
In the past, a priori interconnect prediction, based on Rent’s rule, has been applied mainly for technology evaluation and roadmap applications. These applications do not requir...
Joni Dambre, Dirk Stroobandt, Jan Van Campenhout