Sciweavers

5608 search results - page 364 / 1122
» On the Theory of Matchgate Computations
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ICSE
2003
IEEE-ACM
16 years 7 months ago
Using Benchmarking to Advance Research: A Challenge to Software Engineering
Benchmarks have been used in computer science to compare the performance of computer systems, information retrieval algorithms, databases, and many other technologies. The creatio...
Susan Elliott Sim, Steve M. Easterbrook, Richard C...
CHI
2010
ACM
16 years 1 months ago
MotionBeam: designing for movement with handheld projectors
In this paper we present a novel interaction metaphor for handheld projectors we label MotionBeam. We detail a number of interaction techniques that utilize the physical movement ...
Karl D. D. Willis, Ivan Poupyrev
HRI
2009
ACM
16 years 1 months ago
Creating and using matrix representations of social interaction
This paper explores the use of an outcome matrix as a computational representation of social interaction suitable for implementation on a robot. An outcome matrix expresses the re...
Alan R. Wagner
BIRTHDAY
2009
Springer
16 years 1 months ago
Semi-formal Evaluation of Conversational Characters
Conversational dialogue systems cannot be evaluated in a fully formal manner, because dialogue is heavily dependent on context and current dialogue theory is not precise enough to ...
Ron Artstein, Sudeep Gandhe, Jillian Gerten, Anton...