Sciweavers

272 search results - page 32 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
IH
1999
Springer
14 years 2 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
INFORMS
2010
147views more  INFORMS 2010»
13 years 7 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
FSTTCS
2009
Springer
14 years 2 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
ICPP
2009
IEEE
14 years 4 months ago
SkipStream: A Clustered Skip Graph Based On-demand Streaming Scheme over Ubiquitous Environments
Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as ...
Qifeng Yu, Tianyin Xu, Baoliu Ye, Sanglu Lu, Daoxu...