Sciweavers

953 search results - page 96 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
13 years 9 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 years 8 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
IPPS
1996
IEEE
14 years 4 days ago
Study of Scalable Declustering Algorithms for Parallel Grid Files
Efficient storage and retrieval of large multidimensional datasets is an important concernfor large-scale scientific computations such as long-running time-dependent simulations w...
Bongki Moon, Anurag Acharya, Joel H. Saltz
BMCBI
2010
131views more  BMCBI 2010»
13 years 8 months ago
A comparison of approximation techniques for variance-based sensitivity analysis of biochemical reaction systems
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
Hong-Xuan Zhang, John Goutsias
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 9 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng