57 search results - page 10 / 12 » What Does the Future Hold for Theoretical Computer Science |
TCS
1998
13 years 7 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
WG
2010
Springer
13 years 5 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
CHI
2009
ACM
14 years 8 months ago
2009
ACM
Online voice conversations are becoming ever more popular. People have been logging online text conversations, but what about voice conversations? Walter Ong simply states, "...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
ACSC
2006
IEEE
14 years 1 months ago
2006
IEEE
It is necessary to provide a method to store Web information effectively so it can be utilised as a future knowledge resource. A commonly adopted approach is to classify the retri...