Sciweavers

13987 search results - page 435 / 2798
» The Two Guards Problem
Sort
View
IWPEC
2010
Springer
15 years 4 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
CVPR
2005
IEEE
16 years 9 months ago
Damped Newton Algorithms for Matrix Factorization with Missing Data
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
A. M. Buchanan, Andrew W. Fitzgibbon
PAKDD
2009
ACM
94views Data Mining» more  PAKDD 2009»
16 years 1 months ago
When does Co-training Work in Real Data?
Co-training, a paradigm of semi-supervised learning, may alleviate effectively the data scarcity problem (i.e., the lack of labeled examples) in supervised learning. The standard ...
Charles X. Ling, Jun Du, Zhi-Hua Zhou
NAS
2007
IEEE
16 years 1 months ago
An Efficient SAN-Level Caching Method Based on Chunk-Aging
: SAN-level caching can manage caching within a global view so that global hot data can be identified and cached. However, two problems may be encountered in the existing SAN-level...
Jiwu Shu, Yang Wang 0009, Wei Xue, Yifeng Luo
CONCUR
2007
Springer
16 years 1 months ago
On the Expressive Power of Global and Local Priority in Process Calculi
Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms...
Cristian Versari, Nadia Busi, Roberto Gorrieri