Sciweavers

11740 search results - page 254 / 2348
» More Problems in Rewriting
Sort
View
BTW
2003
Springer
104views Database» more  BTW 2003»
15 years 11 months ago
Konzeptbasierte Anfrageverarbeitung in Mediatorsystemen
: Ein Weg zur Überwindung der Heterogenität bei der Datenintegration in Mediatorsystemen ist die Nutzung semantischer Metadaten in Form eines Vokabulars oder einer Ontologie zur ...
Kai-Uwe Sattler, Ingolf Geist, Rainer Habrecht, Ei...
FOCS
2007
IEEE
16 years 28 days ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ISCAS
2006
IEEE
70views Hardware» more  ISCAS 2006»
16 years 18 days ago
A systolic array technique for determining common approximate substrings
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
Kenneth B. Kent, Jacqueline E. Rice
FCT
2003
Springer
15 years 11 months ago
Proving Integrality Gaps without Knowing the Linear Program
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
Sanjeev Arora
GD
2006
Springer
15 years 10 months ago
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Rolf Klein, Martin Kutz