Sciweavers

1942 search results - page 303 / 389
» HINT: A new way to measure computer performance
Sort
View
ICML
1994
IEEE
15 years 9 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
ECCV
2010
Springer
15 years 9 months ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
ATC
2008
Springer
15 years 8 months ago
Concepts for Autonomous Control Flow Checking for Embedded CPUs
In this paper, we introduce new concepts and methods for checking the correctness of control flow instructions during the execution of programs in embedded CPUs. Detecting and avoi...
Daniel Ziener, Jürgen Teich
CF
2008
ACM
15 years 8 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
DSVIS
2008
Springer
15 years 8 months ago
A Middleware for Seamless Use of Multiple Displays
Abstract. Current multi-display environments (MDEs) can be composed of displays with different characteristics (e.g. resolution, size) located in any position and at different angl...
Satoshi Sakurai, Yuichi Itoh, Yoshifumi Kitamura, ...