2450 search results - page 30 / 490 » Time Mapping with Hypergraphs |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
103
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
SODA
2012
ACM
13 years 3 days ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
87
Voted
RTAS
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...