Sciweavers

974 search results - page 132 / 195
» Parameterized pattern queries
Sort
View
DL
2000
Springer
162views Digital Library» more  DL 2000»
14 years 3 months ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano
NIPS
2007
14 years 9 days ago
Learning Visual Attributes
We present a probabilistic generative model of visual attributes, together with an efficient learning algorithm. Attributes are visual qualities of objects, such as ‘red’, ...
Vittorio Ferrari, Andrew Zisserman
AAAI
2011
12 years 11 months ago
Cross-Language Latent Relational Search: Mapping Knowledge across Languages
Latent relational search (LRS) is a novel approach for mapping knowledge across two domains. Given a source domain knowledge concerning the Moon, “The Moon is a satellite of the...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
15 years 7 days ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 8 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos