Sciweavers

1392 search results - page 146 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
IMC
2007
ACM
14 years 11 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
CIDU
2010
14 years 7 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
15 years 2 months ago
A Hybrid Approach to Discover Bayesian Networks From Databases Using Evolutionary Programming
This paper describes a novel data mining approach that employs evolutionary programming to discover knowledge represented in Bayesian networks. There are two different approaches ...
Man Leung Wong, Shing Yan Lee, Kwong-Sak Leung
SAC
2004
ACM
15 years 3 months ago
Creation and management of versions in multiversion data warehouse
A data warehouse (DW) provides an information for analytical processing, decision making, and data mining tools. On the one hand, the structure and content of a data warehouse ref...
Bartosz Bebel, Johann Eder, Christian Koncilia, Ta...
FMCAD
2009
Springer
15 years 4 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...