Sciweavers

263 search results - page 11 / 53
» Path partitions of hypercubes
Sort
View
PAAPP
1998
149views more  PAAPP 1998»
13 years 8 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
ICASSP
2011
IEEE
13 years 4 days ago
A proportionate adaptive algorithm with variable partitioned block length for acoustic echo cancellation
Due to the nature of an acoustic enclosure, the early part (i.e., direct path and early reflections) of the acoustic echo path is often sparse while the late reverberant part of ...
Pradeep Loganathan, Emanuel A. P. Habets, Patrick ...
ISPAN
2002
IEEE
14 years 1 months ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Distributed Streaming via Packet Partitioning
We propose a system for adaptive streaming from multiple servers to a single receiver over separate network paths. Based on incoming packets, the receiver estimates the available ...
Jacob Chakareski, Pascal Frossard
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
14 years 2 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse