Sciweavers

6365 search results - page 186 / 1273
» Fast Local Computation Algorithms
Sort
View
158
Voted
APNOMS
2006
Springer
15 years 10 months ago
GISness System for Fast TSP Solving and Supporting Decision Making
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...
Iwona Pozniak-Koszalka, Ireneusz Kulaga, Leszek Ko...
CAGD
2005
113views more  CAGD 2005»
15 years 6 months ago
Fast degree elevation and knot insertion for B-spline curves
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using...
Qi-Xing Huang, Shi-Min Hu, Ralph R. Martin
SAC
2008
ACM
15 years 5 months ago
Fast self-healing gradients
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Selfhealing gradients are a frequently used building block for distribut...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...
125
Voted
RT
2005
Springer
15 years 11 months ago
Fast Exact From-Region Visibility in Urban Scenes
We present a fast exact from-region visibility algorithm for 2.5D urban scenes. The algorithm uses a subdivision of line space for identifying visibility interactions in a 2D foot...
Jirí Bittner, Peter Wonka, Michael Wimmer
158
Voted
TIP
2010
111views more  TIP 2010»
15 years 26 days ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli