Sciweavers

1346 search results - page 256 / 270
» On the number of rectangular partitions
Sort
View
VLDB
1998
ACM
91views Database» more  VLDB 1998»
13 years 11 months ago
Determining Text Databases to Search in the Internet
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong ...
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 11 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
HPCN
1997
Springer
13 years 11 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
VLDB
1994
ACM
84views Database» more  VLDB 1994»
13 years 11 months ago
A Transaction Replication Scheme for a Replicated Database with Node Autonomy
Many proposed protocols for replicated databases consider centralized control of each transaction so that given a transaction, some site will monitor the remote data access and tr...
Ada Wai-Chee Fu, David Wai-Lok Cheung
CEC
2009
IEEE
13 years 11 months ago
Towards connectivity improvement in VANETs using bypass links
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...
Bernabé Dorronsoro Díaz, Patricia Ru...