Sciweavers

2957 search results - page 500 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
FOCS
1997
IEEE
13 years 12 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
KDD
1998
ACM
442views Data Mining» more  KDD 1998»
13 years 12 months ago
BAYDA: Software for Bayesian Classification and Feature Selection
BAYDA is a software package for flexible data analysis in predictive data mining tasks. The mathematical model underlying the program is based on a simple Bayesian network, the Na...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...
ALT
1997
Springer
13 years 12 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
ECML
1997
Springer
13 years 12 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
SIGGRAPH
1996
ACM
13 years 12 months ago
Progressive Meshes
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
Hugues Hoppe