Sciweavers

1550 search results - page 155 / 310
» Optimizing search by showing results in context
Sort
View
RSA
2011
131views more  RSA 2011»
15 years 29 days ago
On covering by translates of a set
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
Béla Bollobás, Svante Janson, Oliver...
AMAI
2007
Springer
15 years 6 months ago
Automated theorem proving by resolution in non-classical logics
This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
Viorica Sofronie-Stokkermans
KDD
2007
ACM
193views Data Mining» more  KDD 2007»
16 years 6 months ago
Joint optimization of wrapper generation and template detection
Many websites have large collections of pages generated dynamically from an underlying structured source like a database. The data of a category are typically encoded into similar...
Shuyi Zheng, Ruihua Song, Ji-Rong Wen, Di Wu
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 11 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...