17789 search results - page 402 / 3558 » Exceptional Use Cases |
160
click to vote
ISSAC
2005
Springer
16 years 10 days ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
169
click to vote
PVM
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. The Fortran language has evolved substantially from the Fortran 77 bindings defined in the MPI-1 (Message Passing Interface) standard. Fortran 90 introduced interface bl...
180
Voted
WEBI
2005
Springer
16 years 9 days ago
2005
Springer
The most well known search techniques are perhaps the PageRank and HITS algorithms. In this paper we argue that these algorithms miss an important dimension, the temporal dimensio...
200
click to vote
CIVR
2004
Springer
16 years 7 days ago
2004
Springer
In this paper we present the results of a user study that was conducted in combination with a submission to TRECVID 2003. Search behavior of students querying an interactive video-...
172
click to vote
GC
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...