Sciweavers

3778 search results - page 36 / 756
» Erdos-Ko-Rado for three sets
Sort
View
IDA
2011
Springer
14 years 4 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
TKDE
2012
253views Formal Methods» more  TKDE 2012»
13 years 2 days ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002
AIED
2009
Springer
15 years 4 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
73
Voted
EDM
2009
116views Data Mining» more  EDM 2009»
14 years 7 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
91
Voted
DCG
2010
104views more  DCG 2010»
14 years 7 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...