Sciweavers

2899 search results - page 181 / 580
» Dynamic Trees in Practice
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 4 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
WEBI
2005
Springer
15 years 10 months ago
IPR: Automated Interaction Process Reconciliation
Inter-organizational business processes usually require complex and time-consuming interactions between partners than simple interactions supported by WSDL. Automated reconciliati...
Zongxia Du, Jinpeng Huai, Yunhao Liu, Chunming Hu,...
BMCBI
2007
165views more  BMCBI 2007»
15 years 4 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 11 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
ICDCS
2005
IEEE
15 years 10 months ago
Resilient Capacity-Aware Multicast Based on Overlay Networks
The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust inter-domain multicast rout...
Zhan Zhang, Shigang Chen, Yibei Ling, Randy Chow