Sciweavers

28 search results - page 3 / 6
» Data Partitioning for Parallel Entity Matching
Sort
View
XSYM
2009
Springer
139views Database» more  XSYM 2009»
13 years 12 months ago
A Data Parallel Algorithm for XML DOM Parsing
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
Bhavik Shah, Praveen Rao, Bongki Moon, Mohan Rajag...
CIKM
2005
Springer
13 years 11 months ago
Joint deduplication of multiple record types in relational data
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
Aron Culotta, Andrew McCallum
IPPS
2010
IEEE
13 years 3 months ago
pFANGS: Parallel high speed sequence mapping for Next Generation 454-roche Sequencing reads
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
Sanchit Misra, Ramanathan Narayanan, Wei-keng Liao...
COLCOM
2007
IEEE
13 years 11 months ago
Kademlia for data storage and retrieval in enterprise networks
— Centralized organization of current enterprise networks doesn’t represent an ideal solution in terms of information security and reliability. Denial of service, packet filter...
Natalya Fedotova, Stefano Fanti, Luca Veltri
HPCN
1997
Springer
13 years 9 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