5022 search results - page 410 / 1005 » Data structures and problem solving using Java |
124
click to vote
DEXAW
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
171
click to vote
SIGIR
2012
ACM
13 years 6 months ago
2012
ACM
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
176
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
110
click to vote
WISTP
2007
Springer
15 years 10 months ago
2007
Springer
The network is becoming more and more versatile because of the variety of the computing resources and the communication technologies that have become available. The mobility of the...
160
click to vote
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...