Sciweavers

2107 search results - page 151 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
118
Voted
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 3 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
164
Voted
PAMI
2010
245views more  PAMI 2010»
15 years 2 months ago
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
Thomas Schoenemann, Daniel Cremers
145
Voted
CP
2003
Springer
15 years 8 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
113
Voted
BMCBI
2010
118views more  BMCBI 2010»
15 years 3 months ago
Computing H/D-Exchange rates of single residues from data of proteolytic fragments
Background: Protein conformation and protein/protein interaction can be elucidated by solution-phase Hydrogen/ Deuterium exchange (sHDX) coupled to high-resolution mass analysis o...
Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark...
140
Voted
ACMSE
2009
ACM
15 years 10 months ago
Bit vector algorithms enabling high-speed and memory-efficient firewall blacklisting
In a world of increasing Internet connectivity coupled with increasing computer security risks, security conscious network applications implementing blacklisting technology are be...
J. Lane Thames, Randal Abler, David Keeling