Sciweavers

6833 search results - page 354 / 1367
» Some two-character sets
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
SEMWEB
2007
Springer
16 years 28 days ago
Semantic Enterprise Technologies
Abstract. Nowadays enterprises request information technologies that leverage structured and unstructured information for providing a single integrated view of business problems in...
Massimo Ruffolo, Luigi Guadagno, Inderbir Sidhu
COLT
2005
Springer
16 years 11 days ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
16 years 11 days ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
ILP
2003
Springer
16 years 1 days ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain