Sciweavers

14704 search results - page 484 / 2941
» computing 2007
Sort
View
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 6 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
FGCS
2007
160views more  FGCS 2007»
15 years 6 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 6 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
AIRWEB
2007
Springer
16 years 13 days ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
CIKM
2007
Springer
16 years 13 days ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen