522 search results - page 89 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
105
click to vote
MOBIHOC
2009
ACM
16 years 8 days ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
100
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
106
click to vote
SIGGRAPH
1997
ACM
15 years 3 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
113
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
107
click to vote
BIBM
2008
IEEE
15 years 6 months ago
2008
IEEE
In the post-genomic era, the organization of genes into networks has played an important role in characterizing the functions of individual genes and the interplay between them. I...