3937 search results - page 348 / 788 » Questioning Ubiquitous Computing |
144
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
164
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
102
Voted
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
136
click to vote
CLOR
2006
15 years 8 months ago
2006
We present a new class of statistical models for part-based object recognition. These models are explicitly parametrized according to the degree of spatial structure that they can ...
145
Voted
JUCS
2002
15 years 4 months ago
2002
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...