Sciweavers

3471 search results - page 364 / 695
» Obstacle Numbers of Graphs
Sort
View
177
Voted
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 7 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
IPPS
2005
IEEE
16 years 11 days ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
DCG
2002
106views more  DCG 2002»
15 years 6 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky
IISWC
2009
IEEE
16 years 1 months ago
On the (dis)similarity of transactional memory workloads
— Programming to exploit the resources in a multicore system remains a major obstacle for both computer and software engineers. Transactional memory offers an attractive alternat...
Clay Hughes, James Poe, Amer Qouneh, Tao Li
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
15 years 6 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang