Sciweavers

5221 search results - page 63 / 1045
» An On-line Problem Database
Sort
View
ESANN
2004
13 years 10 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 8 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
WIDM
2004
ACM
14 years 2 months ago
A comprehensive solution to the XML-to-relational mapping problem
The use of relational database management systems (RDBMSs) to store and query XML data has attracted considerable interest with a view to leveraging their powerful and reliable da...
Sihem Amer-Yahia, Fang Du, Juliana Freire
ADBIS
2000
Springer
119views Database» more  ADBIS 2000»
14 years 1 months ago
A Benchmarking Technique for DBMS's with Advanced Data Models
The majority of database benchmarks currently in use in the industry were designed for relational databases. A different class of benchmarks became required for object oriented dat...
Naphtali Rishe, Alexander Vaschillo, Dmitry Vasile...
ICDE
1995
IEEE
98views Database» more  ICDE 1995»
14 years 10 months ago
Relational Database Compression Using Augmented Vector Quantization
Data compression is one way to alleviate the 1/0bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the ...
Wee Keong Ng, Chinya V. Ravishankar