Sciweavers

534 search results - page 6 / 107
» Approximation of Indistinct Concepts
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
11 years 10 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
FUIN
2006
88views more  FUIN 2006»
13 years 7 months ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...
GCB
2004
Springer
139views Biometrics» more  GCB 2004»
14 years 28 days ago
Graph Alignments: A New Concept to Detect Conserved Regions in Protein Active Sites
: We introduce the novel concept of graph alignment, a generalization of graph isomorphism that is motivated by the commonly used multiple sequence alignments. Graph alignments and...
Nils Weskamp, Eyke Hüllermeier, Daniel Kuhn, ...
PLDI
2011
ACM
12 years 10 months ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 10 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...