1370 search results - page 164 / 274 » On grids in topological graphs |
181
click to vote
AFRIGRAPH
2001
ACM
15 years 10 months ago
2001
ACM
: Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a...
173
click to vote
WICON
2008
15 years 7 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
255
click to vote
GMP
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
173
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
166
click to vote
CPC
2002
15 years 6 months ago
2002
Co-learning is a model involving agents from a large population, who interact by playing a fixed game and update their behaviour based on previous experience and the outcome of th...