Sciweavers

1284 search results - page 99 / 257
» Data Structures for Mergeable Trees
Sort
View
ISMB
1993
13 years 9 months ago
Protein Structure Prediction: Selecting Salient Features from Large Candidate Pools
Weintroduce a parallel approach, "DT-SELECT," for selecting features used by inductive learning algorithms to predict protein secondary structure. DT-SELECTis able to ra...
Kevin J. Cherkauer, Jude W. Shavlik
VLDB
2002
ACM
108views Database» more  VLDB 2002»
13 years 7 months ago
Energy-performance trade-offs for spatial access methods on memory-resident data
Abstract. The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight. Energy-conscious design is important at all levels of syste...
Ning An, Sudhanva Gurumurthi, Anand Sivasubramania...
UAI
2000
13 years 9 months ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
VMV
2001
132views Visualization» more  VMV 2001»
13 years 9 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
ISM
2006
IEEE
207views Multimedia» more  ISM 2006»
13 years 7 months ago
Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
Kasturi Chatterjee, Shu-Ching Chen