Sciweavers

517 search results - page 78 / 104
» Efficient Computation of Diverse Query Results
Sort
View
DEXAW
1999
IEEE
119views Database» more  DEXAW 1999»
14 years 1 months ago
Structure-Based Similarity Search with Graph Histograms
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
Apostolos Papadopoulos, Yannis Manolopoulos
ECCC
2008
122views more  ECCC 2008»
13 years 8 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
IMSCCS
2006
IEEE
14 years 2 months ago
Degenerated Primer Design to Amplify the Heavy Chain Variable Region from Immunoglobulin cDNA
Background: The amplification of variable regions of immunoglobulins has become a major challenge in the cloning of antibody genes, whether from hybridoma cell lines or splenic B ...
Wang Ying, Chen Wei, Li Xu, Cheng Bing
AINA
2004
IEEE
14 years 16 days ago
ZBP: A Zone-based Broadcasting Protocol for Wireless Sensor Networks
Abstract. Wireless Sensor Networks (WSNs) have been widely used in motoring and collecting interests of environment information. Packet flooding or broadcasting is an essential fun...
Chih-Yung Chang, Kuei-Ping Shih, Shih-Chieh Lee
CSR
2006
Springer
14 years 14 days ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin