Sciweavers

610 search results - page 120 / 122
» An Efficient Method for Compressed Sensing
Sort
View
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
14 years 11 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
FLAIRS
2006
14 years 11 months ago
Simulated Visual Perception-Based Control for Autonomous Mobile Agents
Autonomous robots, such as automatic vacuum cleaners, toy robot dogs, and autonomous vehicles for the military, are rapidly becoming a part of everyday life. As a result the need ...
Daniel Flower, Burkhard Wünsche, Hans W. Gues...
ISCA
2008
IEEE
119views Hardware» more  ISCA 2008»
14 years 9 months ago
Technology-Driven, Highly-Scalable Dragonfly Topology
Evolving technology and increasing pin-bandwidth motivate the use of high-radix routers to reduce the diameter, latency, and cost of interconnection networks. High-radix networks,...
John Kim, William J. Dally, Steve Scott, Dennis Ab...
AISS
2010
131views more  AISS 2010»
14 years 7 months ago
LWSDM: Layered Web Service Discovery Mechanism
The boom of Service oriented architecture is on substantial rise. SOA developers orchestrate individual SOA objects into web services. It has been a dream of software engineers to...
Shrabani Mallick, D. S. Kushwaha
ICML
2006
IEEE
15 years 10 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth