10890 search results - page 249 / 2178 » Automatic Complexity Analysis |
167
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
182
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
132
click to vote
ISSAC
1989
Springer
15 years 10 months ago
1989
Springer
The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by...
177
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
159
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...