13306 search results - page 379 / 2662 » Theoretical Computer Science |
153
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
170
click to vote
CAD
2006
Springer
15 years 6 months ago
2006
Springer
The minimum distance computation problem between two surfaces is very important in many applications such as robotics, CAD/CAM and computer graphics. Given two implicit algebraic ...
183
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
: Discussing ubiquitous computing, the role of space is not quite clear. To get an understanding of the thinking on space, the main concepts of absolute, relational, and social spa...
181
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
181
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: