Sciweavers

1261 search results - page 85 / 253
» Region growing: a new approach
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
ICCS
2009
Springer
16 years 25 days ago
Time Acceleration Methods for Advection on the Cubed Sphere
Climate simulation will not grow to the ultrascale without new algorithms to overcome the scalability barriers blocking existing implementations. Until recently, climate simulation...
R. K. Archibald, Katherine J. Evans, J. B. Drake, ...
IROS
2007
IEEE
129views Robotics» more  IROS 2007»
16 years 17 days ago
Decomposition of line segments into corner and statistical grown line features in an EKF-SLAM framework
Abstract— Robots are emerging from industrial plants toward every people’s daily life. Thus, navigation in and understanding of human related environments becomes a prerequisit...
Christian Pascal Connette, Oliver Meister, Martin ...
ASPLOS
2006
ACM
16 years 7 days ago
Stealth prefetching
Prefetching in shared-memory multiprocessor systems is an increasingly difficult problem. As system designs grow to incorporate larger numbers of faster processors, memory latency...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
ICNP
2005
IEEE
15 years 12 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood