Sciweavers

3946 search results - page 250 / 790
» The computational complexity of choice sets
Sort
View
GI
2001
Springer
15 years 11 months ago
Towards a Novel Architecture to Support Universal Location Awareness
—The rapid advances in a wide range of wireless access technologies along with an industry-wide IP-convergence have set up the stage for context-aware computing. The “locationâ...
Amiya Bhattacharya, Abhishek Roy, Sajal K. Das
SIGGRAPH
2000
ACM
15 years 11 months ago
Conservative volumetric visibility with occluder fusion
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
Gernot Schaufler, Julie Dorsey, Xavier Déco...
TROB
2002
132views more  TROB 2002»
15 years 6 months ago
Performance of a distributed robotic system using shared communications channels
We have designed and built a set of miniature robots called Scouts and have developed a distributed software system to control them. This paper addresses the fundamental choices we...
Paul E. Rybski, Sascha Stoeter, Maria L. Gini, Dea...
197
Voted
DCC
1996
IEEE
15 years 11 months ago
Symmetric Trellis Coded Vector Quantization
We present here design techniques for trellis-coded vector quantizers with symmetric codebooks that facilitate lowcomplexity quantization as well as partitioning into equiprobable ...
Benjamin Belzer, John D. Villasenor
WAE
1998
118views Algorithms» more  WAE 1998»
15 years 8 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...