Sciweavers

5022 search results - page 636 / 1005
» Data structures and problem solving using Java
Sort
View
ICFP
2006
ACM
16 years 6 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
KCAP
2005
ACM
16 years 10 days ago
Semantic Association of Taxonomy-based Standards Using Ontology
The vision of semantic interoperability, the fluid sharing of digitalized knowledge, has led much research on ontology/schema mapping/aligning. Although this line of research is f...
Hung-Ju Chu, Randy Y. C. Chow, Su-Shing Chen, Raja...
ADC
2003
Springer
182views Database» more  ADC 2003»
16 years 19 hour ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
BMCBI
2010
178views more  BMCBI 2010»
15 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...