Sciweavers

6365 search results - page 192 / 1273
» Fast Local Computation Algorithms
Sort
View
VISUALIZATION
1997
IEEE
15 years 10 months ago
A topology modifying progressive decimation algorithm
Triangle decimation techniques reduce the number of triangles in a mesh, typically to improve interactive rendering performance or reduce data storage and transmission requirement...
William J. Schroeder
TON
2008
120views more  TON 2008»
15 years 5 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
15 years 12 months ago
Almost-Sensorless Localization
— We present a localization method for robots equipped with only a compass, a contact sensor and a map of the environment. In this framework, a localization strategy can be descr...
Jason M. O'Kane, Steven M. LaValle
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 10 months ago
A Family of Adaptive Filter Algorithms in Noise Cancellation for Speech Enhancement
— In many application of noise cancellation, the changes in signal characteristics could be quite fast. This requires the utilization of adaptive algorithms, which converge rapid...
Sayed A. Hadei, Mojtaba Lotfizad
HIS
2009
15 years 4 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl