Sciweavers

3229 search results - page 330 / 646
» The Theory of Timed Automata
Sort
View
ICCV
2007
IEEE
16 years 1 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
16 years 2 days ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter
186
Voted
COGSCI
2007
107views more  COGSCI 2007»
15 years 6 months ago
The Dynamics of Lexical Competition During Spoken Word Recognition
The sounds that make up spoken words are heard in a series and must be mapped rapidly onto words in memory because their elements, unlike those of visual words, cannot simultaneou...
James S. Magnuson, James A. Dixon, Michael K. Tane...
ATAL
2009
Springer
15 years 4 months ago
Replicator Dynamics for Multi-agent Learning: An Orthogonal Approach
Today's society is largely connected and many real life applications lend themselves to be modeled as multi-agent systems. Although such systems as well as their models are d...
Michael Kaisers, Karl Tuyls
WWW
2009
ACM
16 years 7 months ago
Automated construction of web accessibility models from transaction click-streams
Screen readers, the dominant assistive technology used by visually impaired people to access the Web, function by speaking out the content of the screen serially. Using screen rea...
Jalal Mahmud, Yevgen Borodin, I. V. Ramakrishnan, ...