Sciweavers

4972 search results - page 860 / 995
» Ranking on graph data
Sort
View
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
16 years 6 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
CADE
2007
Springer
16 years 6 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
EDBT
2004
ACM
133views Database» more  EDBT 2004»
16 years 6 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
EUROSYS
2007
ACM
16 years 3 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
ICCAD
2002
IEEE
117views Hardware» more  ICCAD 2002»
16 years 3 months ago
An energy-conscious algorithm for memory port allocation
Multiport memories are extensively used in modern system designs because of the performance advantages they offer. The increased memory access throughput could lead to significan...
Preeti Ranjan Panda, Lakshmikantam Chitturi