Sciweavers

392 search results - page 20 / 79
» Reversal Complexity Revisited
Sort
View
SEKE
1993
Springer
13 years 11 months ago
Recovering Conceptual Data Models is Human-Intensive
1 To handle the complexity of modern software systems, a software comprehension strategy pointing out the al abstraction level is necessary. In this context, the role of technology...
Fabio Abbattista, Filippo Lanubile, Giuseppe Visag...
CIE
2008
Springer
13 years 9 months ago
Deterministic Graphical Games Revisited
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
Daniel Andersson, Kristoffer Arnsfelt Hansen, Pete...

Publication
535views
15 years 7 months ago
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
ICIP
2003
IEEE
14 years 9 months ago
Reversible integer KLT for progressive-to-lossless compression of multiple component images
In this paper, we presented a method for integer reversible implementation of KLT for multiple component image compression. The progressive-to-lossless compression algorithm emplo...
P. Hao, Q. Shi
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
14 years 2 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan