Sciweavers

1390 search results - page 12 / 278
» Computing the depth of a flat
Sort
View
PAM
2009
Springer
15 years 10 months ago
Revisiting Route Caching: The World Should Be Flat
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihomi...
Changhoon Kim, Matthew Caesar, Alexandre Gerber, J...
GLOBECOM
2006
IEEE
15 years 10 months ago
Throughput Optimization for Continuous Flat Fading MIMO Channels with Estimation Error
— In this paper, we consider single user throughput optimization problem for continuous flat fading channels of multiple-input multiple-output (MIMO) system. It is known that ch...
Edward W. Jang, Younggeun Cho, John M. Cioffi
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 9 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
PET
2004
Springer
15 years 9 months ago
Electromagnetic Eavesdropping Risks of Flat-Panel Displays
Electromagnetic eavesdropping of computer displays – first demonstrated to the general public by van Eck in 1985 – is not restricted to cathode-ray tubes. Modern flat-panel d...
Markus G. Kuhn
ISVC
2009
Springer
15 years 10 months ago
Dense Depth Maps from Low Resolution Time-of-Flight Depth and High Resolution Color Views
In this paper a systematic approach to the processing and combination of high resolution color images and low resolution time-offlight depth maps is described. The purpose is the ...
Bogumil Bartczak, Reinhard Koch