Sciweavers

725 search results - page 14 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
ECCV
2004
Springer
15 years 11 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
100
Voted
EWNLG
1993
15 years 1 months ago
Choosing a Set of Coherence Relations for Text Generation: A Data-Driven Approach
Abstract. An active research programme in Natural Language Generation has grown up around the notion of `coherence relations'. Relations are being used in a variety of roles i...
Alistair Knott, Robert Dale
CSCW
2012
ACM
13 years 5 months ago
Setting the stage for interaction: a tablet application to augment group discussion in a seminar class
We present a tablet-based system to collaboratively track discussion topics and ideas in a seminar-style discussion classroom. Each student uses his or her own tablet to share tex...
Drew Harry, Eric Gordon, Chris Schmandt
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 2 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich