5606 search results - page 617 / 1122 » Randomization Techniques for Graphs. |
209
click to vote
NAACL
2010
15 years 5 months ago
2010
We examine the viability of building large polarity lexicons semi-automatically from the web. We begin by describing a graph propagation framework inspired by previous work on con...
190
click to vote
RV
2010
Springer
15 years 4 months ago
2010
Springer
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
186
click to vote
JMLR
2011
15 years 2 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
197
click to vote
GRAPHITE
2005
ACM
16 years 18 days ago
2005
ACM
We present a novel method to create perpetual animations from a small set of given keyframes. Existing approaches either are limited to re-sequencing large amounts of existing ima...
193
click to vote
ECIR
2009
Springer
16 years 4 months ago
2009
Springer
Opinion finding is a challenging retrieval task, where it has been shown that it is especially difficult to improve over a strongly performing topic-relevance baseline. In this pa...