5210 search results - page 625 / 1042 » Exact geometric computation |
258
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
151
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
147
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
167
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
144
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...