Sciweavers

39 search results - page 6 / 8
» Computability on Regular Subsets of Euclidean Space
Sort
View
PAMI
2006
134views more  PAMI 2006»
13 years 7 months ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
13 years 2 months ago
Distributed constrained optimization over noisy networks
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
Kunal Srivastava, Angelia Nedic, Dusan M. Stipanov...
IJWMC
2010
115views more  IJWMC 2010»
13 years 4 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
BCB
2010
150views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Enzymatic target identification with dynamic states
As a metabolic network reaches from a state to a steady state, a subset of its fluxes gradually change. The sequence of intermediate states, called the dynamic state, shows the pa...
Bin Song, Sanjay Ranka, Tamer Kahveci
JMLR
2010
155views more  JMLR 2010»
13 years 5 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...