Sciweavers

383 search results - page 21 / 77
» A Bound on the Total Chromatic Number
Sort
View
SPAA
2003
ACM
14 years 27 days ago
Relaxing the problem-size bound for out-of-core columnsort
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Corm...
GLOBECOM
2010
IEEE
13 years 5 months ago
Exploiting Channel Correlations - Simple Interference Alignment Schemes with No CSIT
We explore a few selected multiuser communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with chann...
Syed Ali Jafar
JGAA
2008
100views more  JGAA 2008»
13 years 7 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow
UIST
2004
ACM
14 years 1 months ago
Visual tracking of bare fingers for interactive surfaces
Visual tracking of bare fingers allows more direct manipulation of digital objects, multiple simultaneous users interacting with their two hands, and permits the interaction on l...
Julien Letessier, François Bérard
VRCAI
2006
ACM
14 years 1 months ago
Kinetic bounding volume hierarchies for deformable objects
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
Gabriel Zachmann, Rene Weller