Sciweavers

409 search results - page 29 / 82
» Compact Similarity Joins
Sort
View
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 7 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
14 years 8 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
JSYML
1998
61views more  JSYML 1998»
13 years 7 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
SIGMOD
2010
ACM
174views Database» more  SIGMOD 2010»
14 years 12 days ago
Sampling dirty data for matching attributes
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
Henning Köhler, Xiaofang Zhou, Shazia Wasim S...
CVPR
2010
IEEE
14 years 3 months ago
Efficient Action Spotting based on a Spacetime Oriented Structure Representation
This paper addresses action spotting, the spatiotemporal detection and localization of human actions in video. A novel compact local descriptor of video dynamics in the context of...
Konstantinos Derpanis, Mikhail Sizintsev, Kevin Ca...