Sciweavers

1995 search results - page 58 / 399
» What's the Problem
Sort
View
126
Voted
IPL
1998
95views more  IPL 1998»
15 years 3 months ago
A Variation on the Zero-One Law
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
130
Voted
KDD
1999
ACM
117views Data Mining» more  KDD 1999»
15 years 7 months ago
Identifying Distinctive Subsequences in Multivariate Time Series by Clustering
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
Tim Oates
112
Voted
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 3 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
106
Voted
DATE
2008
IEEE
106views Hardware» more  DATE 2008»
15 years 10 months ago
Software Components for Reliable Automotive Systems
System-level integration requires an overall understanding of the interplay of the sub-systems to enable componentbased development with portability, reconfigurability and extens...
Harald Heinecke, Werner Damm, Bernhard Josko, Alex...
133
Voted
CAI
2006
Springer
15 years 3 months ago
Symbolic Explanation of Similarities in Case-based Reasoning
CBR systems solve problems by assessing their similarity with already solved problems (cases). Explanation of a CBR system prediction usually consists of showing the user the set o...
Eva Armengol, Enric Plaza