Sciweavers

1326 search results - page 252 / 266
» Approximate Tree Kernels
Sort
View
136
Voted
IPL
2010
134views more  IPL 2010»
14 years 8 months ago
Parameterized algorithm for eternal vertex cover
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, D...
151
Voted
FGR
2011
IEEE
227views Biometrics» more  FGR 2011»
14 years 5 months ago
Warp that smile on your face: Optimal and smooth deformations for face recognition
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
Tobias Gass, Leonid Pishchulin, Philippe Dreuw, He...
RECOMB
2006
Springer
16 years 2 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
16 years 2 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
103
Voted
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
15 years 10 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...