Sciweavers

755 search results - page 119 / 151
» Similarity Searching in Peer-to-Peer Databases
Sort
View
LPNMR
2001
Springer
15 years 6 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
PR
2000
117views more  PR 2000»
15 years 1 months ago
Planar shape recognition by shape morphing
A novel method based on shape morphing is proposed for 2D shape recognition. In this framework, the shape of objects is described by using their contour. Shape recognition involve...
Rahul Singh, Nikolaos Papanikolopoulos
EMNLP
2010
14 years 12 months ago
Handling Noisy Queries in Cross Language FAQ Retrieval
Recent times have seen a tremendous growth in mobile based data services that allow people to use Short Message Service (SMS) to access these data services. In a multilingual soci...
Danish Contractor, Govind Kothari, Tanveer A. Faru...
CIKM
2005
Springer
15 years 7 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
BMCBI
2008
211views more  BMCBI 2008»
15 years 2 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle