Sciweavers

21 search results - page 4 / 5
» On the Benefits of Adaptivity in Property Testing of Dense G...
Sort
View
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
14 years 10 days ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir
LREC
2010
225views Education» more  LREC 2010»
13 years 7 months ago
C-3: Coherence and Coreference Corpus
The phenomenon of coreference, covering entities, their mentions and their properties, is intricately linked to the phenomenon of coherence, covering the structure of rhetorical r...
Cristina Nicolae, Gabriel Nicolae, Kirk Roberts
AIED
2005
Springer
13 years 11 months ago
Tradeoff analysis between knowledge assessment approaches
Abstract: The problem of modeling and assessing an individual’s ability level is central to learning environments. Numerous approaches exists to this end. Computer Adaptive Testi...
Michel Desmarais, Shunkai Fu, Xiaoming Pu
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
ECCV
2006
Springer
14 years 7 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...