60 search results - page 2 / 12 » A Separator Theorem for String Graphs and its Applications |
IANDC
2008
13 years 5 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
IJCV
2007
13 years 5 months ago
2007
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
INFOCOM
2007
IEEE
14 years 4 days ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
GG
2008
Springer
13 years 7 months ago
2008
Springer
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
KBSE
2010
IEEE
13 years 4 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...