Sciweavers

3096 search results - page 401 / 620
» Theory and Use of the EM Algorithm
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 6 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
FOCS
2009
IEEE
16 years 1 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ATAL
2009
Springer
16 years 1 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
16 years 17 days ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
ICMCS
2006
IEEE
127views Multimedia» more  ICMCS 2006»
16 years 17 days ago
An Interactive Region-Based Image Clustering and Retrieval Platform
Content-based Image retrieval has become an important part of information retrieval technology. Images can be viewed as high dimensional data and are usually represented by their ...
Ying Liu, Xin Chen, Chengcui Zhang, Alan P. Spragu...