20807 search results - page 113 / 4162 » How to read a paper |
150
click to vote
ARC
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Encryption of volatile FPGA bitstreams provides confidentiality to the design but does not ensure its authenticity. This paper motivates the need for adding authenticati...
166
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
140
click to vote
COMPGEOM
2006
ACM
16 years 13 days ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
142
click to vote
ARGMAS
2005
Springer
16 years 3 hour ago
2005
Springer
In our previous work on dialogue games for agent interaction, an agent’s set of beliefs (Σ) and an agent’s “commitment store” (CS) — the set of locutions uttered by the ...
185
click to vote
ADS
2004
Springer
15 years 12 months ago
2004
Springer
Modeling user affect is becoming increasingly important for intelligent interfaces and agents that aim to establish believable interactions with their users. However, evaluating th...