Sciweavers

236 search results - page 21 / 48
» Graphs, partitions and Fibonacci numbers
Sort
View
APCSAC
2005
IEEE
14 years 1 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...
ICALP
2011
Springer
12 years 11 months ago
Clustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Daniel Lokshtanov, Dániel Marx
MOBICOM
2006
ACM
14 years 1 months ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
DEXA
2004
Springer
136views Database» more  DEXA 2004»
14 years 1 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
FCT
2007
Springer
13 years 12 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee