2004 search results - page 326 / 401 » Sampling from large graphs |
WINE
2010
Springer
13 years 7 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
ICDCS
2009
IEEE
14 years 7 months ago
2009
IEEE
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...
ICB
2009
Springer
14 years 4 months ago
2009
Springer
The goal of the Multiple Biometrics Grand Challenge (MBGC) is to improve the performance of face and iris recognition technology from biometric samples acquired under unconstrained...
BMCBI
2010
13 years 10 months ago
2010
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
KDD
2003
ACM
14 years 10 months ago
2003
ACM
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...