Sciweavers

248 search results - page 48 / 50
» Parameterized Algorithms for Directed Maximum Leaf Problems
Sort
View
CIKM
2007
Springer
14 years 13 days ago
Hybrid results merging
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
COR
2008
99views more  COR 2008»
13 years 6 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
ICALP
2010
Springer
13 years 11 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
SPAA
2004
ACM
13 years 11 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 7 months ago
Analysis of sampling techniques for association rule mining
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...