Sciweavers

7123 search results - page 309 / 1425
» The Ordered Set of Rough Sets
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
The Isomorphism Relation Between Tree-Automatic Structures
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
Olivier Finkel, Stevo Todorcevic
CIKM
2010
Springer
15 years 5 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
TVCG
2010
141views more  TVCG 2010»
15 years 5 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
DM
2010
99views more  DM 2010»
15 years 1 months ago
Perfect octagon quadrangle systems
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
Luigia Berardi, Mario Gionfriddo, Rosaria Rota
JMLR
2010
149views more  JMLR 2010»
15 years 1 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn