1458 search results - page 141 / 292 » Monads for incremental computing |
111
Voted
TOMS
2008
15 years 3 months ago
2008
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
117
Voted
SIGGRAPH
2000
ACM
15 years 8 months ago
2000
ACM
In this paper, we describe an efficient image-based approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry a...
123
Voted
CG
2008
Springer
15 years 5 months ago
2008
Springer
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
155
Voted
ANCS
2009
ACM
15 years 1 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
138
click to vote
HIPC
2003
Springer
15 years 8 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...