Sciweavers

494 search results - page 56 / 99
» Heap Building Bounds
Sort
View
HASKELL
2008
ACM
15 years 4 months ago
Clase: cursor library for a structured editor
The “zipper” is a well known design pattern for providing a cursorlike interface to a data structure. However, the classic treatise by Huet only scratches the surface of some ...
Tristan O. R. Allwood, Susan Eisenbach
JIRS
2007
78views more  JIRS 2007»
15 years 3 months ago
Online-learning and Attention-based Approach to Obstacle Avoidance Using a Range Finder
The problem of developing local reactive obstacle-avoidance behaviors by a mobile robot through online real-time learning is considered. The robot operated in an unknown bounded 2...
Shuqing Zeng, Juyang Weng
180
Voted
COMBINATORICS
2004
243views more  COMBINATORICS 2004»
15 years 3 months ago
Class-Uniformly Resolvable Group Divisible Structures II: Frames
We consider Class-Uniformly Resolvable frames (CURFs), which are group divisible designs with partial resolution classes subject to the class-uniform condition. We derive the nece...
Peter Danziger, Brett Stevens
PAMI
2002
103views more  PAMI 2002»
15 years 3 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette
VLDB
2002
ACM
125views Database» more  VLDB 2002»
15 years 3 months ago
Self-tuning Database Technology and Information Services: from Wishful Thinking to Viable Engineering
Automatic tuning has been an elusive goal for database technology for a long time and is becoming a pressing issue for modern E-services. This paper reviews and assesses the advan...
Gerhard Weikum, Axel Mönkeberg, Christof Hass...