Sciweavers

2778 search results - page 21 / 556
» Limit complexities revisited
Sort
View
EUROCRYPT
2005
Springer
15 years 3 months ago
Reducing Complexity Assumptions for Statistically-Hiding Commitment
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...
LPNMR
2005
Springer
15 years 3 months ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
14 years 10 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
CEC
2010
IEEE
14 years 1 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
CHI
2005
ACM
14 years 11 months ago
Improving revisitation in fisheye views with visit wear
The distortion caused by an interactive fisheye lens can make it difficult for people to remember items and locations in the data space. In this paper we introduce the idea of vis...
Amy Skopik, Carl Gutwin