Sciweavers

1390 search results - page 107 / 278
» Self-Sizing of Clustered Databases
Sort
View
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
14 years 4 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
CLUSTER
2007
IEEE
14 years 3 months ago
Sequential and parallel implementation of a constraint-based algorithm for searching protein structures
— Data mining in biological structure libraries can be a powerful tool to better understand biochemical processes. This article introduces the LISA algorithm which enables the re...
Sascha Hunold, Thomas Rauber, Georg Wille
SOSP
1997
ACM
13 years 10 months ago
Towards Transparent and Efficient Software Distributed Shared Memory
Despite a large research effort, software distributed shared memory systems have not been widely used to run parallel applications across clusters of computers. The higher perform...
Daniel J. Scales, Kourosh Gharachorloo
ICDE
2011
IEEE
258views Database» more  ICDE 2011»
13 years 28 days ago
SystemML: Declarative machine learning on MapReduce
Abstract—MapReduce is emerging as a generic parallel programming paradigm for large clusters of machines. This trend combined with the growing need to run machine learning (ML) a...
Amol Ghoting, Rajasekar Krishnamurthy, Edwin P. D....
DATESO
2006
103views Database» more  DATESO 2006»
13 years 10 months ago
Using WordNet Glosses to Refine Google Queries
This paper describes one of the ways how to overcome one of the major limitations of current fulltext search engines. It deals with synonymy of the web search engine results by clu...
Jan Nemrava