Sciweavers

2254 search results - page 76 / 451
» Computing the minimal covering set
Sort
View
IPPS
2007
IEEE
14 years 4 months ago
A Minimal Access Cost-Based Multimedia Object Replacement Algorithm
Multimedia object caching, by which the same multimedia object can be adapted to diverse mobile appliances through the technique of transcoding, is an important technology for imp...
Keqiu Li, Takashi Nanya, Wenyu Qu
CVPR
2011
IEEE
13 years 6 months ago
Distributed Computer Vision Algorithms Through Distributed Averaging
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
Roberto Tron, René, Vidal
RC
2007
83views more  RC 2007»
13 years 9 months ago
Computing the Pessimism of Inclusion Functions
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
Gilles Chabert, Luc Jaulin
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
14 years 3 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 10 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy