820 search results - page 13 / 164 » Finding low-utility data structures |
CLA
2006
13 years 10 months ago
2006
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
FMCAD
2009
Springer
14 years 3 months ago
2009
Springer
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...
FQAS
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
HICSS
2007
IEEE
14 years 3 months ago
2007
IEEE
Although there is an increasing emphasis on and investment in healthcare information technology (HIT) actual adoption and usage rates are below expectations. This research explore...
ISAAC
1995
Springer
14 years 5 days ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...