Sciweavers

2740 search results - page 15 / 548
» Approximating Component Selection
Sort
View
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
15 years 6 days ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
ECAI
2010
Springer
13 years 8 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
FCT
2003
Springer
14 years 4 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
LCTRTS
2010
Springer
14 years 5 months ago
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
Minming Li, Chun Jason Xue, Tiantian Liu, Yingchao...
IROS
2008
IEEE
116views Robotics» more  IROS 2008»
14 years 5 months ago
Selection of robot pre-grasps using box-based shape approximation
— Grasping is a central issue of various robot applications, especially when unknown objects have to be manipulated by the system. In earlier work, we have shown the efficiency ...
Kai Huebner, Danica Kragic