Sciweavers

419 search results - page 22 / 84
» Two solutions to the adaptive visual servoing problem
Sort
View
JPDC
2007
177views more  JPDC 2007»
13 years 7 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
ISVC
2010
Springer
13 years 6 months ago
A Framework for Visual and Haptic Collaboration in Shared Virtual Spaces
We propose a framework for visual and haptic collaboration in X3D/VRML shared virtual spaces. In this collaborative framework, two pipelines—visual and haptic—complement each o...
Lei Wei, Alexei Sourin, Herbert Stocker
ALT
2002
Springer
14 years 4 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
CPAIOR
2011
Springer
12 years 11 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 4 days ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas