Sciweavers

377 search results - page 9 / 76
» A Value Theory of Meta-Learning Algorithms
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 2 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 11 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 2 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
FLAIRS
2006
15 years 1 months ago
Coalition Formation Meets Information Theory
The process of coalition formation, where distinct autonomous agents come together to act as a coherent group is an important form of interaction in multiagent systems. Previous w...
Victor Palmer, Thomas R. Ioerger
89
Voted
SIAMSC
2010
215views more  SIAMSC 2010»
14 years 10 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang