Sciweavers

IUI
2011
ACM
14 years 20 days ago
Automatically generating stories from sensor data
Recent research in Augmented and Alternative Communication (AAC) has begun to make use of Natural Language Generation (NLG) techniques. This creates an opportunity for constructin...
Joseph Reddington, Nava Tintarev
IUI
2011
ACM
14 years 20 days ago
Protractor3D: a closed-form solution to rotation-invariant 3D gestures
Protractor 3D is a gesture recognizer that extends the 2D touch screen gesture recognizer Protractor [8] to 3D gestures. It inherits many of Protractor’s desirable properties, s...
Sven G. Kratz, Michael Rohs
IUI
2011
ACM
14 years 20 days ago
ChemInk: a natural real-time recognition system for chemical drawings
We describe a new sketch recognition framework for chemical structure drawings that combines multiple levels of visual features using a jointly trained conditional random field. ...
Tom Y. Ouyang, Randall Davis
IUI
2011
ACM
14 years 20 days ago
Predicting and compensating for lexicon access errors
Learning a foreign language is a long, error-prone process, and much of a learner’s time is effectively spent studying vocabulary. Many errors occur because words are only partl...
Lars Yencken, Timothy Baldwin
IUI
2011
ACM
14 years 20 days ago
Design and validation of two-handed multi-touch tabletop controllers for robot teleoperation
Controlling the movements of mobile robots, including driving the robot through the world and panning the robot’s cameras, typically requires many physical joysticks, buttons, a...
Mark Micire, Munjal Desai, Jill L. Drury, Eric McC...
ISSAC
2011
Springer
225views Mathematics» more  ISSAC 2011»
14 years 20 days ago
On the structure of compatible rational functions
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-...
Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li
ISSAC
2011
Springer
243views Mathematics» more  ISSAC 2011»
14 years 20 days ago
Practical polynomial factoring in polynomial time
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
William Hart, Mark van Hoeij, Andrew Novocin
ISR
2011
14 years 20 days ago
Compatibility and Proprietary Standards: The Impact of Conversion Technologies in IT Markets with Network Effects
e from http://ssrn.com/abstract=980726 Acknowledgements: The authors thank Ramayya Krishnan, Marshall Van Alstyne, Senior Editor Sanjeev Dewan, the associate editor and referees fo...
Charles Zhechao Liu, Esther Gal-Or, Chris F. Kemer...
ISQED
2011
IEEE
240views Hardware» more  ISQED 2011»
14 years 20 days ago
Fast optimization of nano-CMOS mixed-signal circuits through accurate metamodeling
—Design optimization methodologies for AMS-SoCs with analog, digital, and mixed-signal portions have not received significant attention, due to their high complexity. In mixed-s...
Oleg Garitselov, Saraju P. Mohanty, Elias Kougiano...