501 search results - page 52 / 101 » Rough Sets and Approximation Schemes |
156
Voted
DAM
2007
15 years 5 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
143
click to vote
AAAI
1994
15 years 7 months ago
1994
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
138
click to vote
PAMI
2008
15 years 5 months ago
2008
We develop a novel method for class-based feature matching across large changes in viewing conditions. The method (called MBE) is based on the property that when objects share a si...
177
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
132
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...