2638 search results - page 63 / 528 » Random Geometric Complexes |
177
Voted
MOBIHOC
2012
ACM
13 years 5 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
105
click to vote
ECCC
2010
15 years 2 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
109
Voted
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
128
Voted
GD
2004
Springer
15 years 8 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
114
click to vote
TOG
2008
15 years 2 months ago
2008
We accurately capture the shape and appearance of a person's hairstyle. We use triangulation and a sweep with planes of light for the geometry. Multiple projectors and camera...