Sciweavers

4930 search results - page 27 / 986
» Learning minimal abstractions
Sort
View
119
Voted
OSDI
2008
ACM
16 years 22 days ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...
112
Voted
COLT
2008
Springer
15 years 2 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy
78
Voted
CHINZ
2005
ACM
15 years 2 months ago
Graphical abstract help
re the use of abstracted screenshots as part of a new help interface. Graphstract, an implementation of a graphical help system, extends the ideas of textually oriented Minimal Ma...
Jeff Huang, Bo Lu, Michael B. Twidale
ECCV
2000
Springer
16 years 2 months ago
Learning Over Multiple Temporal Scales in Image Databases
Abstract. The ability to learn from user interaction is an important asset for content-based image retrieval (CBIR) systems. Over short times scales, it enables the integration of ...
Nuno Vasconcelos, Andrew Lippman
106
Voted
ICRA
2010
IEEE
147views Robotics» more  ICRA 2010»
14 years 11 months ago
Learning physically-instantiated game play through visual observation
Abstract— We present an integrated vision and robotic system that plays, and learns to play, simple physically-instantiated board games that are variants of TIC TAC TOE and HEXAP...
Andrei Barbu, Siddharth Narayanaswamy, Jeffrey Mar...