Sciweavers

4486 search results - page 122 / 898
» Adaptable Boundary Sets
Sort
View
ECCV
2000
Springer
16 years 6 months ago
Significantly Different Textures: A Computational Model of Pre-attentive Texture Segmentation
Abstract. Recent human vision research [1] suggests modelling preattentive texture segmentation by taking a set of feature samples from a local region on each side of a hypothesize...
Ruth Rosenholz
CIKM
2005
Springer
15 years 10 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
BMCBI
2010
117views more  BMCBI 2010»
15 years 4 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
VISSYM
2003
15 years 6 months ago
Adaptive Smooth Scattered Data Approximation for Large-scale Terrain Visualization
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
Martin Bertram, Xavier Tricoche, Hans Hagen
ICAS
2006
IEEE
157views Robotics» more  ICAS 2006»
15 years 10 months ago
Adaptive provisioning using virtual machines and autonomous role-based management
A modern server system must deliver a complex set of obligations towards its users. We study the concept of roles as autonomous encapsulations of a set of promises. Using virtuali...
Kyrre M. Begnum, Mark Burgess, John A. Sechrest