Sciweavers

4378 search results - page 52 / 876
» On the Complexity of Ordered Colourings
Sort
View
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
13 years 3 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
PDCAT
2009
Springer
14 years 3 months ago
Supporting Partial Ordering with the Parallel Iterator
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
Nasser Giacaman, Oliver Sinnen
ADC
2008
Springer
146views Database» more  ADC 2008»
14 years 3 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe
ATAL
2007
Springer
14 years 3 months ago
Intelligent agent framework for order entry and management
This paper describes an agent system we have built to handle order entry and management issue in business computing and specialized in the telecommunication domain. Our system is ...
Thuc Duong Nguyen, Simon Thompson
ISVC
2007
Springer
14 years 3 months ago
Tensor Lines in Tensor Fields of Arbitrary Order
This paper presents a method to reduce time complexity of the computation of higher–order tensor lines. The method can be applied to higher–order tensors and the spherical harm...
Mario Hlawitschka, Gerik Scheuermann, Alfred Anwan...