4131 search results - page 136 / 827 » Compactness in Topology and Computation |
177
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
172
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
151
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The clustered heat map is the most popular means of visualizing genomic data. It compactly displays a large amount of data in an intuitive format that facilitates the ...
240
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
163
click to vote
TVCG
2008
15 years 6 months ago
2008
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...