Sciweavers

66 search results - page 13 / 14
» Conjunctive Query Containment over Trees
Sort
View
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
Ranking the whole MEDLINE database according to a large training set using text indexing
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...
Brian P. Suomela, Miguel A. Andrade
ICASSP
2011
IEEE
12 years 11 months ago
A new method for visual stylometry on impressionist paintings
A new emerging field, that of visual stylometry of art, proposes to apply image analysis and machine learning tools to high-resolution digital images of artwork in order to assis...
Hanchao Qi, Shannon Hughes
STACS
2001
Springer
14 years 4 days ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 8 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman