Sciweavers

948 search results - page 147 / 190
» What can we achieve by arbitrary announcements
Sort
View
SSPR
2010
Springer
13 years 7 months ago
An Empirical Comparison of Kernel-Based and Dissimilarity-Based Feature Spaces
The aim of this paper is to find an answer to the question: What is the difference between dissimilarity-based classifications(DBCs) and other kernelbased classifications(KBCs)?...
Sang-Woon Kim, Robert P. W. Duin
VLDB
1998
ACM
136views Database» more  VLDB 1998»
14 years 1 months ago
Materialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 11 days ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
FOCS
1992
IEEE
14 years 27 days ago
Fault-tolerant Wait-free Shared Objects
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
WS
2003
ACM
14 years 2 months ago
Secure data transmission in mobile ad hoc networks
The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly dep...
Panagiotis Papadimitratos, Zygmunt J. Haas