Sciweavers

1323 search results - page 70 / 265
» Computing the median with uncertainty
Sort
View
ICARCV
2002
IEEE
110views Robotics» more  ICARCV 2002»
15 years 2 months ago
A novel robust method for large numbers of gross errors
In computer vision tasks, it frequently happens that gross noise occupies the absolute majority of the data. Most robust estimators can tolerate no more than 50% gross errors. In ...
Hanzi Wang, David Suter
CCCG
2003
14 years 11 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
CCCG
2009
14 years 11 months ago
The Centervertex Theorem for Wedge Depth
There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...
Gary L. Miller, Todd Phillips, Donald Sheehy
ICMLA
2009
14 years 7 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
WSC
1998
14 years 11 months ago
Rostering by Iterating Integer Programming and Simulation
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
Shane G. Henderson, Andrew J. Mason