Sciweavers

180 search results - page 28 / 36
» Improved bounds on the sample complexity of learning
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
13 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
ICRA
2010
IEEE
104views Robotics» more  ICRA 2010»
13 years 6 months ago
Using model knowledge for learning inverse dynamics
— In recent years, learning models from data has become an increasingly interesting tool for robotics, as it allows straightforward and accurate model approximation. However, in ...
Duy Nguyen-Tuong, Jan Peters
BMCBI
2011
13 years 2 months ago
Statistical learning techniques applied to epidemiology: a simulated case-control comparison study with logistic regression
Background: When investigating covariate interactions and group associations with standard regression analyses, the relationship between the response variable and exposure may be ...
John J. Heine, Walker H. Land Jr., Kathleen M. Ega...
IADIS
2004
13 years 9 months ago
Creative Lesson by Using Cyber Theater and CTSL Learning KIT
To improve the courses of computer-based education in junior high school and high school, we have developed new educational multi-media tool, named Cyber Theater. Cyber Theater pr...
Hiroshi Matsuda, Yoshiaki Shindo
CVPR
2011
IEEE
12 years 11 months ago
How does Person Identity Recognition Help Multi-Person Tracking?
We address the problem of multi-person tracking in a complex scene from a single camera. Although trackletassociation methods have shown impressive results in several challenging ...
Cheng-Hao Kuo, Ram Nevatia