Sciweavers

4865 search results - page 833 / 973
» The Complexity of Graph Connectivity
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 12 days ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
SPAA
2010
ACM
15 years 2 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
ICDE
2010
IEEE
322views Database» more  ICDE 2010»
15 years 9 months ago
XML-Based Computation for Scientific Workflows
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Bertram Ludäscher, Daniel Zinn, Shawn Bowers
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 4 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
CIKM
2009
Springer
15 years 4 months ago
Interactive, topic-based visual text summarization and analysis
We are building an interactive, visual text analysis tool that aids users in analyzing a large collection of text. Unlike existing work in text analysis, which focuses either on d...
Shixia Liu, Michelle X. Zhou, Shimei Pan, Weihong ...