Sciweavers

215 search results - page 32 / 43
» On the Linear Number of Matching Substrings
Sort
View
BMCBI
2007
124views more  BMCBI 2007»
13 years 7 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...
ECCC
2000
140views more  ECCC 2000»
13 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
URBAN
2008
99views more  URBAN 2008»
13 years 7 months ago
A comparison of address point, parcel and street geocoding techniques
The widespread availability of powerful geocoding tools in commercial GIS software and the interest in spatial analysis at the individual level have made address geocoding a widel...
Paul A. Zandbergen
CVIU
2011
12 years 11 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...