Sciweavers

13414 search results - page 2509 / 2683
» The distributed boosting algorithm
Sort
View
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 4 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
MP
2010
119views more  MP 2010»
15 years 4 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
OOPSLA
2010
Springer
15 years 4 months ago
G-Finder: routing programming questions closer to the experts
Programming forums are becoming the primary tools for programmers to find answers for their programming problems. Our empirical study of popular programming forums shows that the...
Wei Li, Charles Zhang, Songlin Hu
PR
2010
126views more  PR 2010»
15 years 4 months ago
Discriminability and reliability indexes: Two new measures to enhance multi-image face recognition
In order to handle complex face image variations in face recognition, multi-image face recognition has been proposed, instead of using a single still-imagebased approach. In many ...
Weiwen Zou, Pong C. Yuen
SAC
2010
ACM
15 years 4 months ago
The 'Dresden Image Database' for benchmarking digital image forensics
This paper introduces and documents a novel image database specifically built for the purpose of development and benchmarking of camera-based digital forensic techniques. More th...
Thomas Gloe, Rainer Böhme
« Prev « First page 2509 / 2683 Last » Next »