Sciweavers

11565 search results - page 1971 / 2313
» Computing Minimal Mappings
Sort
View
ICMLA
2003
15 years 8 months ago
Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
Lukasz A. Kurgan, Krzysztof J. Cios
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 8 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
177
Voted
IJCAI
2003
15 years 8 months ago
A Semantic-Based User Privacy Protection Framework for Web Services
Abstract. Web service technology is an Internet-based distributed computing paradigm to address interoperability in heterogeneous distributed systems. In this paper, we present a p...
Arif Tumer, Asuman Dogac, Ismail Hakki Toroslu
IQ
2003
15 years 8 months ago
ClueMaker: A Language for Approximate Record Matching
We introduce ClueMaker, the first language designed specifically for approximate record matching. Clues written in ClueMaker predict whether two records denote the same thing based...
Martin Buechi, Andrew Borthwick, Adam Winkel, Arth...
WSC
2001
15 years 8 months ago
Accounting for input model and parameter uncertainty in simulation
Taking into account input-model, input-parameter, and stochastic uncertainties inherent in many simulations, our Bayesian approach to input modeling yields valid point and confide...
Faker Zouaoui, James R. Wilson
« Prev « First page 1971 / 2313 Last » Next »