1392 search results - page 123 / 279 » Dynamic Data Structure Analysis for Java Programs |
ML
2010
ACM
14 years 8 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
141
click to vote
GAMEON
2009
14 years 7 months ago
2009
At present, trajectory data, series of coordinate data traversed by moving objects, can be readily obtained due to the advent of positioning technologies. Clustering of trajectori...
105
click to vote
DAWAK
2010
Springer
14 years 11 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
OOPSLA
2007
Springer
15 years 4 months ago
2007
Springer
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
BMCBI
2006
14 years 10 months ago
2006
Background: Two-dimensional data colourings are an effective medium by which to represent three-dimensional data in two dimensions. Such "color-grid" representations hav...