376 search results - page 10 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
AUSAI
2008
Springer
14 years 11 months ago
2008
Springer
The concept of Interchangeability was developed to deal with redundancy of values in the same domain. Conventional algorithms for detecting Neighborhood Interchangeability work by ...
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
SODA
2004
ACM
14 years 10 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...