104 search results - page 20 / 21 » Range queries over skip tree graphs |
PODS
1994
ACM
13 years 9 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
P2P
2009
IEEE
14 years 14 days ago
2009
IEEE
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
DIAGRAMS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We review the use of diagrams in the UK National School Curriculum (NC) and assess it in the light of current research on childrens' graph comprehension. It is noted...
WCRE
2000
IEEE
13 years 10 months ago
2000
IEEE
The purpose of this panel is to report on a structured demonstration for comparing program comprehension tools. Five program comprehension tool designers applied their tools to a ...