840 search results - page 83 / 168 » Open multi-methods for c |
127
click to vote
CSDA
2010
15 years 3 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
141
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
120
click to vote
CCR
2006
15 years 3 months ago
2006
The early detection of applications associated with TCP flows is an essential step for network security and traffic engineering. The classic way to identify flows, i.e. looking at...
137
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
IJWBC
2006
15 years 3 months ago
2006
: The experiences with the new ICTP website, aiming to satisfy the need for a modern and appealing image, as well as provide tailored online information and services to its scienti...