Sciweavers

919 search results - page 61 / 184
» Efficient computation of view subsets
Sort
View
CONEXT
2009
ACM
13 years 10 months ago
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...
DSOM
2007
Springer
14 years 2 months ago
Efficient Web Services Event Reporting and Notifications by Task Delegation
Web Services are an XML technology recently viewed as capable of being used for network management. A key aspect of WS in this domain is event reporting. WS-based research in this ...
Aimilios Chourmouziadis, George Pavlou
DPHOTO
2009
154views Hardware» more  DPHOTO 2009»
13 years 6 months ago
Optimal color filter array design: quantitative conditions and an efficient search procedure
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
Yue M. Lu, Martin Vetterli
CVPR
2010
IEEE
14 years 5 months ago
Safety in Numbers: Learning Categories from Few Examples with Multi Model Knowledge Transfer
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
Tatiana Tommasi, Francesco Orabona, Barbara Caputo
IWPEC
2009
Springer
14 years 3 months ago
Even Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
Daniel Lokshtanov, Saket Saurabh