16883 search results - page 287 / 3377 » Generalized Non-Reducible Descriptors |
163
Voted
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
We study entity ranking on the INEX entity track and propose a simple graph-based ranking approach that enables to combine scores on document and paragraph level. The combined app...
162
click to vote
SIGPLAN
2008
15 years 6 months ago
2008
Programs encounter increasingly complex and fragile mappings to computing platforms, resulting in performance characteristics that are often mysterious to students, practitioners,...
168
click to vote
SIGPLAN
2008
15 years 6 months ago
2008
Programming language "paradigms" are a moribund and tedious legacy of a bygone age. Modern language designers pay them no respect, so why do our courses slavishly adhere...
170
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
177
click to vote
SIGIR
2002
ACM
15 years 6 months ago
2002
ACM
This paper explores the use of Bayesian online classifiers to classify text documents. Empirical results indicate that these classifiers are comparable with the best text classifi...