Sciweavers

598 search results - page 41 / 120
» The Puzzle Layout Problem
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 7 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
14 years 2 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
ICDAR
2003
IEEE
14 years 27 days ago
Discerning Structure from Freeform Handwritten Notes
This paper presents an integrated approach to parsing textual structure in freeform handwritten notes. Textgraphics classification and text layout analysis are classical problems ...
Michael Shilman, Zile Wei, Sashi Raghupathy, Patri...
ICPADS
2007
IEEE
14 years 1 months ago
S/Kademlia: A practicable approach towards secure key-based routing
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicab...
Ingmar Baumgart, Sebastian Mies
IPPS
2007
IEEE
14 years 1 months ago
Coordinating Data Parallel SAC Programs with S-Net
We propose a two-layered approach for exploiting different forms of concurrency in complex systems: We specify computational components in our functional array language SaC, whic...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...