Sciweavers

492 search results - page 37 / 99
» Perfect Matching Preservers
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
IPPS
2007
IEEE
15 years 6 months ago
Performance Modelling of Peer-to-Peer Routing
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
IDEAL
2007
Springer
15 years 6 months ago
Analysis of Tiling Microarray Data by Learning Vector Quantization and Relevance Learning
We apply learning vector quantization to the analysis of tiling microarray data. As an example we consider the classification of C. elegans genomic probes as intronic or exonic. T...
Michael Biehl, Rainer Breitling, Yang Li
WG
2007
Springer
15 years 6 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki