Sciweavers

16596 search results - page 160 / 3320
» Generalized Assignment Problems
Sort
View
WWW
2007
ACM
15 years 10 months ago
Page-level template detection via isotonic smoothing
We develop a novel framework for the page-level template detection problem. Our framework is built on two main ideas. The first is the automatic generation of training data for a ...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
MLDM
2009
Springer
15 years 4 months ago
Dynamic Score Combination: A Supervised and Unsupervised Score Combination Method
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...
Roberto Tronci, Giorgio Giacinto, Fabio Roli
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
15 years 4 months ago
SAT-based optimal hypergraph partitioning with replication
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
Michael G. Wrighton, André DeHon
ACSAC
2003
IEEE
15 years 3 months ago
Automatic Reassembly of Document Fragments via Context Based Statistical Models
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
Kulesh Shanmugasundaram, Nasir D. Memon