11371 search results - page 1977 / 2275 » The network inhibition problem |
173
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
206
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
182
click to vote
INFOCOM
2006
IEEE
16 years 26 days ago
2006
IEEE
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
176
click to vote
COMPGEOM
2006
ACM
16 years 24 days ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
183
click to vote
COMPGEOM
2006
ACM
16 years 24 days ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...