Sciweavers

5 search results - page 1 / 1
» Monochromatic simplices of any volume
Sort
View
CCCG
2008
13 years 8 months ago
Monochromatic simplices of any volume
We give a very short proof of the following result of Graham from 1980: For any finite coloring of Rd , d 2, and for any > 0, there is a monochromatic (d + 1)-tuple that span...
Adrian Dumitrescu, Minghui Jiang
TVCG
2012
184views Hardware» more  TVCG 2012»
11 years 9 months ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan
HPDC
2008
IEEE
13 years 7 months ago
Eliminating the middleman: peer-to-peer dataflow
Efficiently executing large-scale, data-intensive workflows such as Montage must take into account the volume and pattern of communication. When orchestrating data-centric workflo...
Adam Barker, Jon B. Weissman, Jano I. van Hemert
TIT
2002
70views more  TIT 2002»
13 years 7 months ago
High-rate codes that are linear in space and time
Multiple-antenna systems that operate at high rates require simple yet effective space-time transmission schemes to handle the large traffic volume in real time. At rates of tens ...
Babak Hassibi, Bertrand M. Hochwald
WS
2006
ACM
14 years 1 months ago
Proactive security for mobile messaging networks
The interoperability of IM (Instant Messaging) and SMS (Short Messaging Service) networks allows users to seamlessly use a variety of computing devices from desktops to cellular p...
Abhijit Bose, Kang G. Shin