Sciweavers

13987 search results - page 177 / 2798
» The Two Guards Problem
Sort
View
144
Voted
ICCAD
1998
IEEE
196views Hardware» more  ICCAD 1998»
15 years 7 months ago
Analysis of watermarking techniques for graph coloring problem
We lay out a theoretical framework to evaluate watermarking techniques for intellectual property protection (IPP). Based on this framework, we analyze two watermarking techniques ...
Gang Qu, Miodrag Potkonjak
154
Voted
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
15 years 7 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
103
Voted
NAA
2000
Springer
88views Mathematics» more  NAA 2000»
15 years 7 months ago
Schwarz Methods for Convection-Diffusion Problems
Abstract. Various variants of Schwarz methods for a singularly perturbed two dimensional stationary convection-diffusion problem are constructed and analysed. The iteration counts,...
H. MacMullen, Eugene O'Riordan, Grigorii I. Shishk...
89
Voted
ESANN
2007
15 years 5 months ago
Several ways to solve the MSO problem
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
Jochen J. Steil
149
Voted
IPCO
1993
98views Optimization» more  IPCO 1993»
15 years 4 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...