Sciweavers

1787 search results - page 85 / 358
» Approximation Techniques for Spatial Data
Sort
View
TON
2008
125views more  TON 2008»
13 years 8 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
INFOCOM
2009
IEEE
14 years 3 months ago
Downlink MIMO with Frequency-Domain Packet Scheduling for 3GPP LTE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
Suk-Bok Lee, Sayantan Choudhury, Ahmad Khoshnevis,...
ICIP
2001
IEEE
14 years 10 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
VLSID
2006
IEEE
136views VLSI» more  VLSID 2006»
14 years 9 months ago
Improved Data Compression for Serial Interconnected Network on Chip through Unused Significant Bit Removal
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...
Simon Ogg, Bashir M. Al-Hashimi
WIMOB
2009
IEEE
14 years 3 months ago
Exploiting RF-Scatter: Human Localization with Bistatic Passive UHF RFID-Systems
—In ubiquitous computing, localization of users in indoor environments is a challenging issue. On the one hand, localization data needs to have fine granularity to provide reaso...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann