Sciweavers

948 search results - page 169 / 190
» What can we achieve by arbitrary announcements
Sort
View
TSP
2010
13 years 2 months ago
Low complexity equalization for doubly selective channels modeled by a basis expansion
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
Tomasz Hrycak, Saptarshi Das, Gerald Matz, Hans G....
ICMI
2007
Springer
121views Biometrics» more  ICMI 2007»
14 years 1 months ago
A tactile language for intuitive human-robot communication
Abstract— This paper presents a tactile language for controlling a robot through its artificial skin. This language greatly improves the multimodal human-robot communication by ...
Andreas J. Schmid, Martin Hoffmann, Heinz Wör...
ANCS
2006
ACM
14 years 1 months ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 2 months ago
Supporting annotations on relations
Annotations play a key role in understanding and curating databases. Annotations may represent comments, descriptions, lineage information, among several others. Annotation manage...
Mohamed Y. Eltabakh, Walid G. Aref, Ahmed K. Elmag...
FPGA
2004
ACM
119views FPGA» more  FPGA 2004»
14 years 28 days ago
A quantitative analysis of the speedup factors of FPGAs over processors
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported. This paper presents an analysis, both quantitative a...
Zhi Guo, Walid A. Najjar, Frank Vahid, Kees A. Vis...