2018 search results - page 213 / 404 » Magnitude-preserving ranking algorithms |
145
click to vote
COLING
2004
15 years 6 months ago
2004
cross-linguistically valid claims about which discourses are easier to process, abstracting away from specific algorithms for anaphora resolution or anaphora generation (although m...
197
click to vote
AAAI
2011
14 years 6 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
302
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
151
click to vote
VIS
2006
IEEE
16 years 7 months ago
2006
IEEE
ing Abstract Data Using Animation Amit P. Sawant Department of Computer Science, North Carolina State University Christopher G. Healey Department of Computer Science, North Carolin...
182
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
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...