Sciweavers

162 search results - page 2 / 33
» On Guillotine Cutting Sequences
Sort
View
DAC
2001
ACM
14 years 11 months ago
Improved Cut Sequences for Partitioning Based Placement
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
Mehmet Can Yildiz, Patrick H. Madden
MKM
2009
Springer
14 years 5 months ago
From Tessellations to Table Interpretation
The extraction of the relations of nested table headers to content cells is automated with a view to constructing narrow domain ontologies of semistructured web data. A taxonomy of...
Ramana C. Jandhyala, Mukkai S. Krishnamoorthy, Geo...
ICIP
2002
IEEE
15 years 13 days ago
Shot detection in video sequences using entropy based metrics
A new method for detecting shot boundaries in video sequences using metrics based on information theory is proposed. The method relies on the mutual information and the joint entr...
Zuzana Cernekova, Christophoros Nikou, Ioannis Pit...

Publication
255views
12 years 8 months ago
Ant-Q Hyper-Heuristic Approach for solving 2-Dimensional Cutting Stock Problem
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
Imen Khamassi, Moez Hammami, Khaled Ghédira
RSA
2002
99views more  RSA 2002»
13 years 10 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott