2233 search results - page 74 / 447 » On the Complexity of Theory Curbing |
146
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
186
click to vote
LATA
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
180
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
152
click to vote
IFIP
2000
Springer
15 years 9 months ago
2000
Springer
New non-desktop technologies may turn out to be of a more open and generic nature than traditional information technologies. These technologies consequently pose novel challenges ...
156
click to vote
PLANX
2008
15 years 7 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...