Sciweavers

219 search results - page 29 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
PR
2000
129views more  PR 2000»
13 years 7 months ago
Personal identification based on handwriting
In this paper, a novel algorithm is presented for writer identification from handwritings. Principal Component Analysis is applied to the gray-scale handwriting images to find a s...
H. E. S. Said, T. N. Tan, Keith D. Baker
SPAA
2010
ACM
13 years 7 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
COR
2006
94views more  COR 2006»
13 years 7 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
ICML
2000
IEEE
14 years 8 months ago
Duality and Geometry in SVM Classifiers
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
Kristin P. Bennett, Erin J. Bredensteiner