Sciweavers

833 search results - page 128 / 167
» Geometric Optimization
Sort
View
ICML
2004
IEEE
14 years 9 months ago
Learning large margin classifiers locally and globally
A new large margin classifier, named MaxiMin Margin Machine (M4 ) is proposed in this paper. This new classifier is constructed based on both a "local" and a "globa...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
ISBI
2006
IEEE
14 years 9 months ago
A statistical framework for DTI segmentation
We address the problem of the segmentation of cerebral white matter structures from diffusion tensor images (DTI). DTI can be estimated from a set of diffusion weighted images and...
Christophe Lenglet, Mikaël Rousson, Rachid De...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 9 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 9 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat