Sciweavers

1196 search results - page 207 / 240
» DASCOSA: Database Support for Computational Science Applicat...
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 28 days ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
BMCBI
2011
12 years 11 months ago
Protein alignment algorithms with an efficient backtracking routine on multiple GPUs
Background: Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for seque...
Jacek Blazewicz, Wojciech Frohmberg, Michal Kierzy...
GIS
2006
ACM
14 years 8 months ago
Generalization of land cover maps by mixed integer programming
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
Jan-Henrik Haunert, Alexander Wolff
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 7 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 7 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb