61 search results - page 11 / 13 » On the Number of Graphical Forest Partitions |
IJCNN
2000
IEEE
14 years 3 days ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
We will demonstrate a wireless sensor network system for the surveillance of critical areas and properties – e.g. borders. The system consists of up to 10 sensor nodes that moni...
VRML
2003
ACM
14 years 29 days ago
2003
ACM
New acquisition and modeling tools make it easier to create 3D models, and affordable and powerful graphics hardware makes it easier to use them. As a result, the number of 3D mo...
GD
2004
Springer
14 years 1 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
FCCM
2008
IEEE
14 years 2 months ago
2008
IEEE
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...