Sciweavers

15485 search results - page 447 / 3097
» Computing Optimal Subsets
Sort
View
196
Voted
COR
2006
72views more  COR 2006»
15 years 6 months ago
Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...
Said Fathy El-Zoghdy, Hisao Kameda, Jie Li
IJIPT
2007
116views more  IJIPT 2007»
15 years 6 months ago
Context as autonomic intelligence in a ubiquitous computing environment
: This paper presents the ANS architecture that uses ubiquitous computing to monitor medical patients in the home. Since there is no notion of the patient carrying out maintenance ...
Markus C. Huebscher, Julie A. McCann, Asher Hoskin...
AMC
2007
89views more  AMC 2007»
15 years 6 months ago
A numerical iterative scheme for computing finite order rank-one convex envelopes
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...
Xin Wang, Zhiping Li
188
Voted
IJCV
2000
133views more  IJCV 2000»
15 years 6 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
CVPR
2010
IEEE
15 years 4 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel