3328 search results - page 159 / 666 » Topological Quantum Computation |
147
Voted
ICDCS
2010
IEEE
15 years 5 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...
133
Voted
CAD
2005
Springer
15 years 3 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...
183
Voted
MOBIHOC
2007
ACM
16 years 3 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...
127
Voted
TVCG
2008
15 years 3 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...
129
Voted
PG
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...