Sciweavers

518 search results - page 36 / 104
» Beating a Random Assignment
Sort
View
EDM
2009
116views Data Mining» more  EDM 2009»
15 years 8 days 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
SIGIR
2009
ACM
15 years 9 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
CORR
2010
Springer
177views Education» more  CORR 2010»
15 years 2 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
SECON
2007
IEEE
15 years 8 months ago
Fairness and Physical Layer Capture in Random Access Networks
Abstract— While physical layer capture has been observed in real implementations of wireless devices which randomly accessing shared channels, fair rate control algorithms based ...
Hoon Chang, Vishal Misra, Dan Rubenstein
CIKM
2007
Springer
15 years 8 months ago
Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases
We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Sema...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito