61 search results - page 11 / 13 » On the Number of Graphical Forest Partitions |
186
click to vote
IJCNN
2000
IEEE
15 years 10 months 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...
156
click to vote
SENSYS
2009
ACM
16 years 28 days 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...
165
Voted
VRML
2003
ACM
15 years 11 months 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...
181
click to vote
GD
2004
Springer
15 years 11 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...
205
click to vote
FCCM
2008
IEEE
16 years 18 days 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...