Sciweavers

6906 search results - page 1259 / 1382
» An algorithm for modelling key terms
Sort
View
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
15 years 10 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
POPL
2005
ACM
15 years 10 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
15 years 10 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
MOBIHOC
2008
ACM
15 years 9 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
WWW
2010
ACM
15 years 5 months ago
Relational duality: unsupervised extraction of semantic relations between entities on the web
Extracting semantic relations among entities is an important first step in various tasks in Web mining and natural language processing such as information extraction, relation de...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
« Prev « First page 1259 / 1382 Last » Next »