Sciweavers

4850 search results - page 392 / 970
» Approximate Data Structures with Applications
Sort
View
ICEIS
2009
IEEE
16 years 1 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
STRINGOLOGY
2004
15 years 8 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...
ACTA
2008
136views more  ACTA 2008»
15 years 7 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
BMCBI
2010
164views more  BMCBI 2010»
15 years 4 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
CIKM
2007
Springer
16 years 1 months ago
Autonomously semantifying wikipedia
Berners-Lee’s compelling vision of a Semantic Web is hindered by a chicken-and-egg problem, which can be best solved by a bootstrapping method — creating enough structured dat...
Fei Wu, Daniel S. Weld