6142 search results - page 313 / 1229 » The Complexity of Partition Functions |
174
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
181
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
The difficulty of scaling Online Social Networks (OSNs) has introduced new system design challenges that has often caused costly re-architecting for services like Twitter and Face...
175
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
218
click to vote
ICFP
2000
ACM
15 years 11 months ago
2000
ACM
This paper describes FC++: a rich library supporting functional programming in C++. Prior approaches to encoding higher order functions in C++ have suffered with respect to polymo...
185
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Development of robust and efficient methods for analyzing and interpreting high dimension gene expression profiles continues to be a focus in computational biology. Th...