Sciweavers

230 search results - page 22 / 46
» Testing Closeness of Discrete Distributions
Sort
View
WEBI
2004
Springer
15 years 7 months ago
Mining Local Data Sources For Learning Global Cluster Models
— Distributed data mining has recently caught a lot of attention as there are many cases where pooling distributed data for mining is probibited, due to either huge data volume o...
Chak-Man Lam, Xiaofeng Zhang, William Kwok-Wai Che...
AIMSA
2008
Springer
15 years 4 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
ICML
2000
IEEE
16 years 2 months ago
Maximum Entropy Markov Models for Information Extraction and Segmentation
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
Andrew McCallum, Dayne Freitag, Fernando C. N. Per...
ICDCSW
2006
IEEE
15 years 8 months ago
The Key Knob
Locks are mechanical fastening devices used on various kinds of objects like doors and vehicles, and they can be released using a certain type of key. They have a long history, fr...
Alois Ferscha, Clemens Holzmann, Stefan Resmerita
COMGEO
2008
ACM
15 years 2 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos