4171 search results - page 357 / 835 » Choice numbers of graphs |
165
click to vote
UAI
2008
15 years 8 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
192
click to vote
DMIN
2006
15 years 8 months ago
2006
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
152
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
191
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...
159
click to vote
COMBINATORICS
2007
15 years 7 months ago
2007
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...