Sciweavers

3008 search results - page 543 / 602
» Independence in connected graphs
Sort
View
CIKM
2007
Springer
16 years 15 days ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
16 years 14 days ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
16 years 8 days ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
SPAA
2006
ACM
16 years 8 days ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
15 years 11 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...