Sciweavers

4541 search results - page 616 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 11 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 9 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 8 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
VLDB
2004
ACM
144views Database» more  VLDB 2004»
16 years 7 months ago
Preserving mapping consistency under schema changes
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
Yannis Velegrakis, Renée J. Miller, Lucian Popa
CVPR
2005
IEEE
16 years 25 days ago
Robust Face Detection with Multi-Class Boosting
With the aim to design a general learning framework for detecting faces of various poses or under different lighting conditions, we are motivated to formulate the task as a classi...
Yen-Yu Lin, Tyng-Luh Liu