Sciweavers

3281 search results - page 385 / 657
» Bases for parametrized iterativity
Sort
View
NIPS
2004
15 years 8 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu
GRIDNETS
2008
15 years 7 months ago
Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
Xiaohua Li
ANOR
2008
171views more  ANOR 2008»
15 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj
167
Voted
IJCV
2006
142views more  IJCV 2006»
15 years 6 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...