Sciweavers

13841 search results - page 2259 / 2769
» Algorithms and Constraint Programming
Sort
View
CIKM
2004
Springer
16 years 2 days ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
COLT
2004
Springer
16 years 2 days ago
Performance Guarantees for Regularized Maximum Entropy Density Estimation
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
Miroslav Dudík, Steven J. Phillips, Robert ...
DEXA
2004
Springer
190views Database» more  DEXA 2004»
16 years 2 days ago
On Efficient and Effective Association Rule Mining from XML Data
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, A. Mi...
IWPEC
2004
Springer
16 years 1 days ago
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
Jens Gramm, Till Nierhoff, Till Tantau
NOSSDAV
2004
Springer
16 years 1 days ago
Managing a portfolio of overlay paths
In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneou...
Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ra...
« Prev « First page 2259 / 2769 Last » Next »