498 search results - page 62 / 100 » A Theory of Complexity for Continuous Time Systems |
107
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
IJIQ
2008
14 years 11 months ago
2008
: The increase in the volume of information be handled by organisations has increased pressure on corporate boards to ensure that legislative, accountability, business and cultural...
IDA
2002
Springer
14 years 11 months ago
2002
Springer
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...