Sciweavers

278 search results - page 50 / 56
» A Framework for Counterexample Generation and Exploration
Sort
View
85
Voted
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 2 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 10 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
81
Voted
SIGIR
2011
ACM
14 years 1 months ago
Social context summarization
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
Zi Yang, Keke Cai, Jie Tang, Li Zhang, Zhong Su, J...
94
Voted
CVPR
2004
IEEE
16 years 8 days ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
93
Voted
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
15 years 10 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang