Sciweavers

2783 search results - page 62 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
16 years 2 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
15 years 7 months ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...
ECCV
2010
Springer
15 years 6 months ago
Representing Pairwise Spatial and Temporal Relations for Action Recognition
The popular bag-of-words paradigm for action recognition tasks is based on building histograms of quantized features, typically at the cost of discarding all information about rela...
AMW
2010
15 years 2 months ago
Chasing after Secrets in Relational Databases
Abstract. Inference control can guarantee confidentiality but is costly to implement. Access control can be implemented efficiently but cannot guarantee confidentiality. Hence, it ...
Joachim Biskup, Sven Hartmann, Sebastian Link, Jan...
82
Voted
EMNLP
2008
15 years 2 months ago
It's a Contradiction - no, it's not: A Case Study using Functional Relations
Contradiction Detection (CD) in text is a difficult NLP task. We investigate CD over functions (e.g., BornIn(Person)=Place), and present a domain-independent algorithm that automa...
Alan Ritter, Stephen Soderland, Doug Downey, Oren ...