Sciweavers

4451 search results - page 820 / 891
» On Random Ordering Constraints
Sort
View
AUSAI
2003
Springer
14 years 2 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
COMPGEOM
2010
ACM
14 years 2 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
EUROPAR
2009
Springer
14 years 1 months ago
SSD-HDD-Hybrid Virtual Disk in Consolidated Environments
Abstract. With the prevalence of multi-core processors and cloud computing, the server consolidation using virtualization has increasingly expanded its territory, and the degree of...
Heeseung Jo, Youngjin Kwon, Hwanju Kim, Euiseong S...
CVPR
2010
IEEE
14 years 1 months ago
The Automatic Design of Feature Spaces for Local Image Descriptors using an Ensemble of Non-linear Feature Extractors
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
Gustavo Carneiro