Sciweavers

450 search results - page 90 / 90
» Satisfiability with Exponential Families
Sort
View
JNS
2010
107views more  JNS 2010»
13 years 16 days ago
Ground States and Critical Points for Aubry-Mather Theory in Statistical Mechanics
We consider statistical mechanics systems defined on a set with some symmetry properties (namely, the set admits an action by a group, which is finitely generated and residually fi...
Rafael de La Llave, Enrico Valdinoci
ICDE
2012
IEEE
228views Database» more  ICDE 2012»
11 years 8 months ago
A General Method for Estimating Correlated Aggregates over a Data Stream
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
Srikanta Tirthapura, David P. Woodruff
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 8 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 5 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
11 years 8 months ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...