Sciweavers

281 search results - page 27 / 57
» A Method for Invariant Generation for Polynomial Continuous ...
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
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...
Jonathan A. Kelner, Aleksander Madry
ISCAS
2006
IEEE
93views Hardware» more  ISCAS 2006»
14 years 1 months ago
Radial distribution power flow studies in a remotely distributed environment
—With the continued push toward dispersed generation and distributed intelligent devices throughout the distribution system, a proper analysis method for understanding the operat...
Michael Kleinberg, Karen Miu, Chika O. Nwankpa
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
NIPS
1998
13 years 9 months ago
Controlling the Complexity of HMM Systems by Regularization
This paper introduces a method for regularization of HMM systems that avoids parameter overfitting caused by insufficient training data. Regularization is done by augmenting the E...
Christoph Neukirchen, Gerhard Rigoll
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 6 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...