3395 search results - page 77 / 679 » Designs, Disputes and Strategies |
173
click to vote
CHARME
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Automatic formal verification techniques generally require exponential resources with respect to the number of primary inputs of a netlist. In this paper, we present sev...
179
click to vote
FUIN
2008
15 years 6 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
122
click to vote
TIT
2002
15 years 5 months ago
2002
This paper provides a mathematical analysis of transform compression in its relationship to linear and nonlinear approximation theory. Contrasting linear and nonlinear approximatio...
170
click to vote
GRAMMARS
2000
15 years 6 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
155
click to vote
HRI
2009
ACM
16 years 29 days ago
2009
ACM
This paper proposes a model of approach behavior with which a robot can initiate conversation with people who are walking. We developed the model by learning from the failures in ...