Sciweavers

501 search results - page 52 / 101
» Rough Sets and Approximation Schemes
Sort
View
DAM
2007
177views more  DAM 2007»
13 years 10 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
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 ...
Michael J. Todd, E. Alper Yildirim
AAAI
1994
13 years 11 months ago
Incremental Recompilation of Knowledge
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...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...
PAMI
2008
152views more  PAMI 2008»
13 years 10 months ago
Class-Based Feature Matching Across Unrestricted Transformations
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...
Evgeniy Bart, Shimon Ullman
ASIACRYPT
2004
Springer
14 years 3 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
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...
Craig Gentry, Zulfikar Ramzan
VLDB
2005
ACM
86views Database» more  VLDB 2005»
14 years 3 months ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
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...
Panagiotis Karras, Nikos Mamoulis