71228 search results - page 14135 / 14246 » Algorithms |
130
Voted
AINA
2009
IEEE
14 years 11 months ago
2009
IEEE
Searching very large collections can be costly in both computation and storage. To reduce this cost, recent research has focused on reducing the size (pruning) of the inverted ind...
148
Voted
ALGOSENSORS
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
119
Voted
AMW
2009
14 years 11 months ago
2009
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
138
click to vote
ANCS
2009
ACM
14 years 11 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
140
click to vote
AND
2009
14 years 11 months ago
2009
In this paper, we propose an alternative method for accessing the content of Greek historical documents printed during the 17th and 18th centuries by searching words directly in d...