Sciweavers

849 search results - page 145 / 170
» Completely Non-malleable Schemes
Sort
View
EUROCRYPT
1995
Springer
14 years 16 days ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
MAMMO
2010
Springer
13 years 11 months ago
Mammogram Compression Using Super-Resolution
Abstract. As mammography moves towards completely digital and produces prohibitive amounts of data, compression plays an increasingly important role. Although current lossless comp...
Jun Zheng, Olac Fuentes, Ming-Ying Leung, Elais Ja...
ACL
2008
13 years 10 months ago
Arabic Morphological Tagging, Diacritization, and Lemmatization Using Lexeme Models and Feature Ranking
We investigate the tasks of general morphological tagging, diacritization, and lemmatization for Arabic. We show that for all tasks we consider, both modeling the lexeme explicitl...
Ryan Roth, Owen Rambow, Nizar Habash, Mona T. Diab...
VISSYM
2004
13 years 10 months ago
Isosurface Computation Made Simple
This paper presents a simple approach for rendering isosurfaces of a scalar field. Using the vertex programming capability of commodity graphics cards, we transfer the cost of com...
Valerio Pascucci
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 10 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand