Sciweavers

925 search results - page 173 / 185
» Connectivity on Complete Lattices
Sort
View
ICALP
2010
Springer
13 years 8 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 8 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
DAGSTUHL
2004
13 years 8 months ago
An Example for Metamodeling Syntax and Semantics of Two Languages, their Transformation, and a Correctness Criterion
We study a metamodel for the Entity Relationship (ER) and the Relational data model. We do this by describing the syntax of the ER data model by introducing classes for ER schemata...
Martin Gogolla
ICHIM
2001
104views more  ICHIM 2001»
13 years 8 months ago
The New Norwegian Rock Art Database
The Rock Art Project was set up by the Directorate for Cultural Heritage on behalf of the Norwegian Ministry of the Environment in 1996. The database was initiated within the EU-s...
Wenche Helliksen, Inger Marie Holm-Olsen, Olaug Ha...
KDID
2004
140views Database» more  KDID 2004»
13 years 8 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...