Sciweavers

1861 search results - page 43 / 373
» 1.6-Bit Pattern Databases
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 2 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
VISUAL
2007
Springer
15 years 8 months ago
Potentialities of Chorems as Visual Summaries of Geographic Databases Contents
Chorems are schematized representations of territories, and so they can represent a good visual summary of spatial databases. Indeed for spatial decision-makers, it is more importa...
Vincenzo Del Fatto, Robert Laurini, Karla Lopez, R...
WEBDB
2007
Springer
159views Database» more  WEBDB 2007»
15 years 8 months ago
A clustering-based sampling approach for refreshing search engine's database
Due to resource constraints, search engines usually have difficulties keeping the local database completely synchronized with the Web. To detect as many changes as possible, the ...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
WIS
2004
15 years 3 months ago
Pruning Update Log Files in Intermittently Connected Databases
Modern databases allow mobile clients that subscribe to replicated data, to process the replica without requiring continuous connectivity, and to receive the updates while connecte...
Liton Chakraborty, Ajit Singh, Kshirasagar Naik
JGAA
2007
135views more  JGAA 2007»
15 years 2 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento