Sciweavers

1648 search results - page 153 / 330
» On the generation of bicliques of a graph
Sort
View
IWCMC
2009
ACM
14 years 2 months ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 1 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
BMCBI
2007
134views more  BMCBI 2007»
13 years 10 months ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd
TKDE
2008
125views more  TKDE 2008»
13 years 10 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel