Sciweavers

4137 search results - page 328 / 828
» On the number of matchings of a tree
Sort
View
GLOBECOM
2007
IEEE
16 years 1 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
ICC
2007
IEEE
155views Communications» more  ICC 2007»
16 years 1 months ago
On Supporting Robust Voice Multicasting Over Ad Hoc Wireless Networks
Abstract— In this paper, we address the problem of voice multicasting in ad hoc wireless networks. The unique characteristics of voice traffic (viz. small packet size, high pack...
G. Venkat Raju, Tamma Bheemarjuna Reddy, C. Siva R...
BROADNETS
2006
IEEE
16 years 27 days ago
Robust Demand-Driven Video Multicast over Ad hoc Wireless Networks
Abstract— In this paper, we address the problem of video multicasting in ad hoc wireless networks. The salient characteristics of video traffic make conventional multicasting pr...
D. Agrawal, Tamma Bheemarjuna Reddy, C. Siva Ram M...
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
15 years 10 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli