1477 search results - page 106 / 296 » Random Convex Programs |
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
EURONGI
2006
Springer
14 years 16 days ago
2006
Springer
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...