Sciweavers

4674 search results - page 188 / 935
» cases 2008
Sort
View
DKE
2006
93views more  DKE 2006»
15 years 6 months ago
The ramification problem in temporal databases: Changing beliefs about the past
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Grigoris Antoniou, Dimitris Plexo...
DM
2006
79views more  DM 2006»
15 years 6 months ago
Restricted even permutations and Chebyshev polynomials
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
Toufik Mansour
IJHCI
2008
83views more  IJHCI 2008»
15 years 6 months ago
A Framework and an Environment for Collaborative Analysis of User Experience
senting them at different levels of abstraction. This can make the analysis complex and unwieldy, requiring teams of analysts to manage it. A new approach to managing the complexit...
Youn-Kyung Lim, Yvonne Rogers
IJNSEC
2008
106views more  IJNSEC 2008»
15 years 6 months ago
Comments on the Security Flaw of Hwang et al.'s Blind Signature Scheme
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
Fang-Ping Chiang, Yi-Mien Lin, Ya-Fen Chang
IPL
2008
105views more  IPL 2008»
15 years 6 months ago
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
Mario A. Lopez, Shlomo Reisner