Sciweavers

1313 search results - page 61 / 263
» Data Discretization Unification
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
Towards in-place geometric algorithms and data structures
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
Hervé Brönnimann, Timothy M. Chan, Eri...
SIGKDD
2008
159views more  SIGKDD 2008»
13 years 7 months ago
Data mining with cellular automata
A cellular automaton is a discrete, dynamical system composed of very simple, uniformly interconnected cells. Cellular automata may be seen as an extreme form of simple, localized...
Tom Fawcett
ISCAS
1999
IEEE
104views Hardware» more  ISCAS 1999»
14 years 18 hour ago
Controlling an integrator through data networks: stability in the presence of unknown time-variant delays
The subject of controlling an integrator via a communication network finds many applications in modern control systems. Stability conditions in closed form are derived for the ari...
Peter H. Bauer, Mihail L. Sichitiu, Kamal Premarat...
ICML
2005
IEEE
14 years 8 months ago
Computational aspects of Bayesian partition models
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
Mikko Koivisto, Kismat Sood
PR
2006
87views more  PR 2006»
13 years 7 months ago
Prototype reduction schemes applicable for non-stationary data sets
All of the prototype reduction schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-nei...
Sang-Woon Kim, B. John Oommen