Sciweavers

137 search results - page 13 / 28
» Efficient Tree Search in Encrypted Data
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
DASFAA
2006
IEEE
152views Database» more  DASFAA 2006»
14 years 3 months ago
Effective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
Jianjun Xu, Jiaheng Lu, Wei Wang 0009, Baile Shi
AINA
2009
IEEE
14 years 4 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 10 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
BMCBI
2006
116views more  BMCBI 2006»
13 years 10 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...