417 search results - page 49 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
147
Voted
IMR
2003
Springer
15 years 10 months ago
2003
Springer
We present a new mesh warping algorithm for tetrahedral meshes based upon weighted laplacian smoothing. We start with a 3D domain which is bounded by a triangulated surface mesh a...
144
Voted
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
154
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
144
Voted
ECCC
2000
15 years 4 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
138
Voted
CONSTRAINTS
1998
15 years 4 months ago
1998
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...