Sciweavers

1709 search results - page 278 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
WEBDB
2010
Springer
178views Database» more  WEBDB 2010»
15 years 10 months ago
Using Latent-Structure to Detect Objects on the Web
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
Luciano Barbosa, Juliana Freire
PRIB
2010
Springer
176views Bioinformatics» more  PRIB 2010»
15 years 2 months ago
An On/Off Lattice Approach to Protein Structure Prediction from Contact Maps
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
Stefano Teso, Cristina Di Risio, Andrea Passerini,...
ICDAR
2011
IEEE
14 years 4 months ago
A New Fourier-Moments Based Video Word and Character Extraction Method for Recognition
— This paper presents a new method based on Fourier and moments features to extract words and characters from a video text line in any direction for recognition. Unlike existing ...
Deepak Rajendran, Palaiahnakote Shivakumara, Bolan...
VLDB
2005
ACM
180views Database» more  VLDB 2005»
15 years 10 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...
ICML
2004
IEEE
16 years 5 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall