Sciweavers

994 search results - page 90 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
FOSSACS
2004
Springer
15 years 8 months ago
Reasoning about Dynamic Policies
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...
Riccardo Pucella, Vicky Weissman
108
Voted
SDM
2009
SIAM
108views Data Mining» more  SDM 2009»
16 years 10 days ago
Highlighting Diverse Concepts in Documents.
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the differ...
Evimaria Terzi, Kun Liu, Tyrone Grandison
IPPS
2009
IEEE
15 years 9 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
CVPR
2010
IEEE
15 years 7 months ago
Compression of Surface Registration using Beltrami Coefficients
Surface registration is widely used in machine vision and medical imaging, where 1-1 correspondences between surfaces are computed to study their variations. Surface maps are usua...
Lok Ming Lui
BMCBI
2010
142views more  BMCBI 2010»
15 years 3 months ago
Classification of protein sequences by means of irredundant patterns
Background: The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of diff...
Matteo Comin, Davide Verzotto