Sciweavers

1866 search results - page 147 / 374
» Robust Algorithms and Price of Robustness in Shunting Proble...
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 6 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
RTSS
1999
IEEE
15 years 10 months ago
A Scalable Solution to the Multi-Resource QoS Problem
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
Chen Lee, John P. Lehoczky, Daniel P. Siewiorek, R...
GMP
2006
IEEE
16 years 8 days ago
Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
Joon-Kyung Seong, Gershon Elber, Elaine Cohen
GPEM
2008
128views more  GPEM 2008»
15 years 6 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
CVPR
2010
IEEE
16 years 2 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...