Sciweavers

2834 search results - page 310 / 567
» Representing Trees with Constraints
Sort
View
ESA
2009
Springer
120views Algorithms» more  ESA 2009»
16 years 1 months ago
Rank-Pairing Heaps
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
GLOBECOM
2008
IEEE
16 years 1 months ago
WONDER: A PON over a Folded Bus
— Passive Optical Networks (PONs) represent a step forward in “first mile” networks; indeed, by using optical technologies, PONs can transfer a large amount of data, and by ...
Andrea Bianco, Davide Cuda, Jorge M. Finochietto, ...
ADC
2008
Springer
146views Database» more  ADC 2008»
16 years 28 days 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
ECSQARU
2007
Springer
16 years 23 days ago
Dialectical Explanations in Defeasible Argumentation
Abstract. This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undevel...
Alejandro Javier García, Nicolás D. ...
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
16 years 21 days ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia