Sciweavers

33 search results - page 5 / 7
» Building Very Large Neighbour-joining Trees
Sort
View
AI
2011
Springer
13 years 2 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 7 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
VLDB
2002
ACM
131views Database» more  VLDB 2002»
13 years 7 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
WCRE
2010
IEEE
13 years 5 months ago
Predicting Re-opened Bugs: A Case Study on the Eclipse Project
—Bug fixing accounts for a large amount of the software maintenance resources. Generally, bugs are reported, fixed, verified and closed. However, in some cases bugs have to be...
Emad Shihab, Akinori Ihara, Yasutaka Kamei, Walid ...
ICDM
2010
IEEE
264views Data Mining» more  ICDM 2010»
13 years 5 months ago
Block-GP: Scalable Gaussian Process Regression for Multimodal Data
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
Kamalika Das, Ashok N. Srivastava