Sciweavers

569 search results - page 65 / 114
» High Performance Reasoning with Very Large Knowledge Bases
Sort
View
ADC
2003
Springer
106views Database» more  ADC 2003»
15 years 3 months ago
Database Component Ware
Database modeling is still a job of an artisan. Due to this approach database schemata evolve by growth without any evolution plan. Finally, they cannot be examined, surveyed, con...
Bernhard Thalheim
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 1 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
ICPR
2002
IEEE
15 years 10 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
INFOCOM
2006
IEEE
15 years 3 months ago
Evaluating Mobility Pattern Space Routing for DTNs
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
Jeremie Leguay, Timur Friedman, Vania Conan
MSWIM
2006
ACM
15 years 3 months ago
Estimation of perceived quality of service for applications on IPv6 networks
To provide high quality service to future Internet applications, IPv6 performance measurements are needed. However, to the best of our knowledge, IPv6 delay and loss performance e...
Xiaoming Zhou, Henk Uijterwaal, Robert E. Kooij, P...