Sciweavers

4797 search results - page 332 / 960
» The complexity of partition tasks
Sort
View
JSA
2006
82views more  JSA 2006»
15 years 6 months ago
A flocking based algorithm for document clustering analysis
ct 7 Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, 8 we present a novel Flocking based approach for doc...
Xiaohui Cui, Jinzhu Gao, Thomas E. Potok
PODC
2011
ACM
14 years 9 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...

Source Code
1763views
17 years 3 months ago
dlib C++ Library
A library for developing portable applications that deal with networking, threads (message passing, futures, etc...), graphical interfaces, complex data structures, linear algebra,...
Davis E. King
CHI
2003
ACM
16 years 7 months ago
An interactive poster exhibit puts visitors in the picture, in real time
This describes the usability and interaction challenges in creating a unique museum exhibit which utilized real-time compositing, and sought to hide complex computational and netw...
Kevin Walker
CIE
2009
Springer
16 years 1 months ago
On Generating Independent Random Strings
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
Marius Zimand