Sciweavers

363 search results - page 56 / 73
» Partial Multicuts in Trees
Sort
View
WWW
2006
ACM
14 years 10 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
XSYM
2009
Springer
139views Database» more  XSYM 2009»
14 years 4 months ago
A Data Parallel Algorithm for XML DOM Parsing
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
Bhavik Shah, Praveen Rao, Bongki Moon, Mohan Rajag...
ISSAC
1995
Springer
155views Mathematics» more  ISSAC 1995»
14 years 1 months ago
On the Implementation of Dynamic Evaluation
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
Peter A. Broadbery, T. Gómez-Díaz, S...
BMCBI
2008
138views more  BMCBI 2008»
13 years 10 months ago
Automated simultaneous analysis phylogenetics (ASAP): an enabling tool for phlyogenomics
Background: The availability of sequences from whole genomes to reconstruct the tree of life has the potential to enable the development of phylogenomic hypotheses in ways that ha...
Indra Neil Sarkar, Mary G. Egan, Gloria M. Coruzzi...
COCOON
2007
Springer
14 years 4 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...