Sciweavers

741 search results - page 109 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
TSP
2010
13 years 3 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
ESOP
2001
Springer
14 years 1 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
ICML
2009
IEEE
14 years 9 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
CIDR
2009
136views Algorithms» more  CIDR 2009»
13 years 9 months ago
The Role of Schema Matching in Large Enterprises
To date, the principal use case for schema matching research has been as a precursor for code generation, i.e., constructing mappings between schema elements with the end goal of ...
Ken Smith, Michael Morse, Peter Mork, Maya Hao Li,...