5064 search results - page 220 / 1013 » Recent Developments in Gridsolve |
151
click to vote
SIGACT
2010
15 years 4 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
187
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden s...
156
click to vote
EMMCVPR
2009
Springer
16 years 1 months ago
2009
Springer
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
194
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...
174
click to vote
INFSOF
2006
15 years 6 months ago
2006
: The Standish Group reported in 1994 that the average cost overrun of software projects was as high as 189%. This cost overrun number is used as input in recent governmental repor...