Sciweavers

1314 search results - page 254 / 263
» Approximate data mining in very large relational data
Sort
View
EUROPAR
2009
Springer
15 years 4 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
80
Voted
EUROPAR
2003
Springer
15 years 2 months ago
FOBS: A Lightweight Communication Protocol for Grid Computing
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
Phillip M. Dickens
BMCBI
2006
120views more  BMCBI 2006»
14 years 9 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
JACM
2008
91views more  JACM 2008»
14 years 9 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari
ORGSCI
2010
92views more  ORGSCI 2010»
14 years 8 months ago
Are Technology-Intensive Industries More Dynamically Competitive? No and Yes
A growing body of research in management and related public policy fields concludes that the 1980s and 1990s saw greater dynamic competition throughout technology−intensive (“...
Paul M. Vaaler, Gerry McNamara