2244 search results - page 181 / 449 » Subjective Document Classification Using Network Analysis |
106
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
112
click to vote
SIAMNUM
2010
14 years 9 months ago
2010
In the solution of Fluid-Structure Interaction problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers, that interact, in an itera...
105
click to vote
SIAMNUM
2010
14 years 9 months ago
2010
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
100
click to vote
WWW
2006
ACM
16 years 3 months ago
2006
ACM
Previous work on spatio-temporal analysis of news items and other documents has largely focused on broad categorization of small text collections by region or country. A system fo...
136
click to vote
PEWASUN
2004
ACM
15 years 8 months ago
2004
ACM
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, ...