Sciweavers

579 search results - page 55 / 116
» New efficiency results for makespan cost sharing
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
15 years 1 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
CORR
2010
Springer
207views Education» more  CORR 2010»
14 years 12 months ago
Collaborative Hierarchical Sparse Modeling
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...
Pablo Sprechmann, Ignacio Ramírez, Guillerm...
KDD
2005
ACM
146views Data Mining» more  KDD 2005»
16 years 7 days ago
Anonymity-preserving data collection
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
15 years 3 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
SAS
2000
Springer
15 years 3 months ago
Tree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
Laurent Mauborgne