Sciweavers

583 search results - page 32 / 117
» On small blocking sets and their linearity
Sort
View
MOBIHOC
2002
ACM
15 years 11 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
JC
2008
128views more  JC 2008»
14 years 11 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
CORR
2004
Springer
103views Education» more  CORR 2004»
14 years 11 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
ASSETS
2005
ACM
15 years 1 months ago
Toward Goldilocks' pointing device: determining a "just right" gain setting for users with physical impairments
We designed and evaluated an agent that recommends a pointing device gain for a given user, with mixed success. 12 participants with physical impairments used the Input Device Age...
Heidi Horstmann Koester, Edmund F. LoPresti, Richa...
TIT
2011
149views more  TIT 2011»
14 years 6 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...