Sciweavers

2089 search results - page 300 / 418
» A New Problem in String Searching
Sort
View
COMPGEOM
2010
ACM
15 years 3 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
SIGMOD
2010
ACM
250views Database» more  SIGMOD 2010»
14 years 10 months ago
Expressive and flexible access to web-extracted data: a keyword-based structured query language
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
Jeffrey Pound, Ihab F. Ilyas, Grant E. Weddell
BMCBI
2010
205views more  BMCBI 2010»
14 years 10 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...
ECML
1998
Springer
15 years 2 months ago
Predicate Invention and Learning from Positive Examples Only
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
Henrik Boström
CP
2006
Springer
15 years 1 months ago
Retroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...