240 search results - page 3 / 48 » The Tree Inclusion Problem: In Optimal Space and Faster |
FOCS
1992
IEEE
13 years 8 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
AIED
2011
Springer
12 years 8 months ago
2011
Springer
Both human and automated tutors must infer what a student knows and plan future actions to maximize learning. Though substantial research has been done on tracking and modeling stu...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
FORMATS
2006
Springer
13 years 8 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...
ISPD
2009
ACM
13 years 11 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...