Sciweavers

993 search results - page 20 / 199
» Set Constraints on Regular Terms
Sort
View
FSTTCS
2004
Springer
14 years 2 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
EMMCVPR
2011
Springer
12 years 8 months ago
Curvature Regularization for Curves and Surfaces in a Global Optimization Framework
Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...
Petter Strandmark, Fredrik Kahl
ICDE
2005
IEEE
125views Database» more  ICDE 2005»
14 years 2 months ago
QoSMig: Adaptive Rate-Controlled Migration of Bulk Data in Storage Systems
Abstract— Logical reorganization of data and requirements of differentiated QoS in information systems necessitate bulk data migration by the underlying storage layer. Such data ...
Koustuv Dasgupta, Sugata Ghosal, Rohit Jain, Upend...
DAM
2007
88views more  DAM 2007»
13 years 8 months ago
Hybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
Jesse D. Bingham, Brad Bingham
COLT
2004
Springer
14 years 2 months ago
Performance Guarantees for Regularized Maximum Entropy Density Estimation
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
Miroslav Dudík, Steven J. Phillips, Robert ...