796 search results - page 113 / 160 » Approximating the centroid is hard |
BC
2002
13 years 7 months ago
2002
Different mechanisms that could form the molecular basis for bi-directional synaptic plasticity have been identified experimentally and corresponding biophysical models can be cons...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
GPEM
2010
13 years 6 months ago
2010
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
JCO
2010
13 years 6 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...