Sciweavers

6368 search results - page 949 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 7 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
IROS
2009
IEEE
205views Robotics» more  IROS 2009»
16 years 1 months ago
Probabilistic categorization of kitchen objects in table settings with a composite sensor
— In this paper, we investigate the problem of 3D object categorization of objects typically present in kitchen environments, from data acquired using a composite sensor. Our fra...
Zoltan Csaba Marton, Radu Bogdan Rusu, Dominik Jai...
LFCS
2007
Springer
16 years 29 days ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
CMPB
2010
141views more  CMPB 2010»
15 years 7 months ago
Real-time segmentation by Active Geometric Functions
Recent advances in 4D imaging and real-time imaging provide image data with clinically important cardiac dynamic information at high spatial or temporal resolution. However, the en...
Qi Duan, Elsa D. Angelini, Andrew F. Laine
CGF
2008
227views more  CGF 2008»
15 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...