Sciweavers

1986 search results - page 307 / 398
» Path Separability of Graphs
Sort
View
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
14 years 3 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 10 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
RE
2006
Springer
13 years 10 months ago
Interaction Analysis in Aspect-Oriented Models
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
Katharina Mehner, Mattia Monga, Gabriele Taentzer
VIS
2005
IEEE
204views Visualization» more  VIS 2005»
14 years 11 months ago
Differential Protein Expression Analysis via Liquid-Chromatography/Mass-Spectrometry Data Visualization
Differential protein expression analysis is one of the main challenges in proteomics. It denotes the search for proteins, whose encoding genes are differentially expressed under a...
Lars Linsen, Julia Löcherbach, Matthias Berth...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
14 years 4 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...