Sciweavers

2850 search results - page 558 / 570
» On Timed Models and Full Abstraction
Sort
View
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
14 years 29 days ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
CP
2005
Springer
14 years 29 days ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
ER
2005
Springer
200views Database» more  ER 2005»
14 years 28 days ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
14 years 28 days ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 28 days ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...