336 search results - page 17 / 68 » Improved data structures for fully dynamic biconnectivity |
203
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
107
click to vote
OTM
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We propose a virtual teacher for the evaluation of students’ competencies. It aims to improve learning by making personalized suggestions on the learning materials. It ...
124
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
187
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...