Sciweavers

4486 search results - page 622 / 898
» Adaptable Boundary Sets
Sort
View
CIKM
2000
Springer
15 years 11 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
DEXA
2000
Springer
100views Database» more  DEXA 2000»
15 years 11 months ago
Contextualization of OODB Schemas in CROME
View mechanisms, widely used in the relational databases, pose new questions in the object model which captures much more semantics. In this paper, we will focus on inheritance and...
Olivier Caron, Bernard Carré, Laurent Debra...
DOLAP
1999
ACM
15 years 11 months ago
Design and Selection of Materialized Views in a Data Warehousing Environment: A Case Study
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
Goretti K. Y. Chan, Qing Li, Ling Feng
DAWAK
1999
Springer
15 years 11 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel