Sciweavers

2889 search results - page 538 / 578
» Querying Structured Hyperdocuments
Sort
View
SIGKDD
2000
106views more  SIGKDD 2000»
13 years 7 months ago
Data mining for hypertext: A tutorial survey
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a di erence to the e ectiveness of infor...
Soumen Chakrabarti
CC
1998
Springer
100views System Software» more  CC 1998»
13 years 7 months ago
Symmetric Alternation Captures BPP
We introduce the natural class SP 2 containing those languages which may be expressed in terms of two symmetric quanti ers. This class lies between P 2 and P 2 P 2 and naturall...
Alexander Russell, Ravi Sundaram
JIIS
2002
99views more  JIIS 2002»
13 years 7 months ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
TKDE
2002
121views more  TKDE 2002»
13 years 7 months ago
ACIRD: Intelligent Internet Document Organization and Retrieval
This paper presents an intelligent Internet information system, Automatic Classifier for the Internet Resource Discovery (ACIRD), which uses machine learning techniques to organiz...
Shian-Hua Lin, Meng Chang Chen, Jan-Ming Ho, Yueh-...
TON
2002
175views more  TON 2002»
13 years 7 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher