Sciweavers

14779 search results - page 410 / 2956
» On Ultrametric Algorithmic Information
Sort
View
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
16 years 1 months ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
CIKM
2006
Springer
15 years 10 months ago
Matching and evaluation of disjunctive predicates for data stream sharing
New optimization techniques, e. g., in data stream management systems (DSMSs), make the treatment of disjunctive predicates a necessity. In this paper, we introduce and compare me...
Richard Kuntschke, Alfons Kemper
CONTEXT
2005
Springer
15 years 8 months ago
Minimality and Non-determinism in Multi-context Systems
Multi-context systems can be used to represent contextual information and inter-contextual information flow. We show that the local model semantics of a multi-context system is co...
Floris Roelofsen, Luciano Serafini
174
Voted
WAIM
2007
Springer
16 years 29 days ago
Improvements of HITS Algorithms for Spam Links
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
Yasuhito Asano, Yu Tezuka, Takao Nishizeki
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers