Sciweavers

306 search results - page 43 / 62
» Constructive algebraic integration theory
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
14 years 12 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 12 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 6 months ago
Provenance for Aggregate Queries
We study in this paper provenance information for queries with aggregation. Provenance information was studied in the context of various query languages that do not allow for aggr...
Yael Amsterdamer, Daniel Deutch, Val Tannen
PLDI
2011
ACM
14 years 2 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
FOCS
2009
IEEE
15 years 6 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