1431 search results - page 73 / 287 » The complexity of random ordered structures |
171
click to vote
WSCG
2004
15 years 7 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
191
click to vote
TSP
2008
15 years 6 months ago
2008
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
185
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
182
click to vote
ICC
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
170
click to vote
INFOCOM
2007
IEEE
16 years 14 days ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...