Sciweavers

329 search results - page 37 / 66
» Uniform variable splitting
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 7 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
RSA
2008
80views more  RSA 2008»
15 years 5 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
185
Voted
SPLC
2010
15 years 4 months ago
Configuring Software Product Line Feature Models Based on Stakeholders' Soft and Hard Requirements
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...
Ebrahim Bagheri, Tommaso Di Noia, Azzurra Ragone, ...
TIT
2011
121views more  TIT 2011»
15 years 1 months ago
Strongly Consistent Estimation of the Sample Distribution of Noisy Continuous-Parameter Fields
The general problem of defining and determining the sample distribution in the case of continuousparameter random fields, is addressed. Defining a distribution in the case of d...
Shahar Z. Kovalsky, Guy Cohen, Joseph M. Francos