Sciweavers

234 search results - page 35 / 47
» Rademacher Margin Complexity
Sort
View
PARLE
1993
13 years 11 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
Robert Marek, Erhard Rahm
SEKE
1993
Springer
13 years 11 months ago
Recovering Conceptual Data Models is Human-Intensive
1 To handle the complexity of modern software systems, a software comprehension strategy pointing out the al abstraction level is necessary. In this context, the role of technology...
Fabio Abbattista, Filippo Lanubile, Giuseppe Visag...
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
13 years 11 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
ACNS
2010
Springer
161views Cryptology» more  ACNS 2010»
13 years 10 months ago
Multi-trail Statistical Saturation Attacks
Abstract. Statistical Saturation Attacks have been introduced and applied to the block cipher PRESENT at CT-RSA 2009. In this paper, we consider their natural extensions. First, we...
Baudoin Collard, François-Xavier Standaert
ICPR
2010
IEEE
13 years 9 months ago
A Reliability Assessment Paradigm for Automated Video Tracking Systems
Most existing performance evaluation methods concentrate on defining separate metrics over a wide range of conditions and generating standard benchmarking video sequences for exam...
Chung-Hao Chen, Yi Yao, Andreas Koschan, Mongi Abi...