Sciweavers

291 search results - page 6 / 59
» On Generalizing Pawlak Approximation Operators
Sort
View
JAT
2011
93views more  JAT 2011»
13 years 2 months ago
Approximation theorems for group valued functions
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
Jorge Galindo, Manuel Sanchis
ISDA
2009
IEEE
14 years 2 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
14 years 8 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
SAC
2006
ACM
14 years 1 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
ITCC
2003
IEEE
14 years 22 days ago
The Effects of Search Engines and Query Operators on Top Ranked Results
We examine whether the use of query operators changes the documents retrieved by three popular Web search engines. One hundred queries containing query operators were selected fro...
Bernard J. Jansen, Caroline M. Eastman