Sciweavers

932 search results - page 113 / 187
» Where in the Wikipedia Is That Answer
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICML
2004
IEEE
14 years 8 months ago
Convergence of synchronous reinforcement learning with linear function approximation
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
Artur Merke, Ralf Schoknecht
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 8 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
WWW
2009
ACM
14 years 8 months ago
Interactive search in XML data
In a traditional keyword-search system in XML data, a user composes a keyword query, submits it to the system, and retrieves relevant subtrees. In the case where the user has limi...
Guoliang Li, Jianhua Feng, Lizhu Zhou
SIGCSE
2009
ACM
132views Education» more  SIGCSE 2009»
14 years 8 months ago
Retina: helping students and instructors based on observed programming activities
It is difficult for instructors of CS1 and CS2 courses to get accurate answers to such critical questions as "how long are students spending on programming assignments?"...
Christian Murphy, Gail E. Kaiser, Kristin Loveland...