Sciweavers

5726 search results - page 165 / 1146
» Supporting annotations on relations
Sort
View
98
Voted
ESANN
2008
15 years 2 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
SE
2008
15 years 2 months ago
Relating Product Line Context to Requirements Engineering Processes Using Design Rationale
: The design of engineering processes is dependent on the context they are designed for. This paper presents the results of an action research study that used design rationale to d...
Samuel Fricker, Reinhard Stoiber
ACL
1997
15 years 2 months ago
Interleaving Universal Principles and Relational Constraints over Typed Feature Logic
We introduce a typed feature logic system providing both universal implicational principles as well as definite clauses over feature terms. We show that such an architecture suppo...
Thilo Götz, Detmar Meurers
107
Voted
TCS
2008
15 years 17 days ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
135
Voted
CORR
1999
Springer
145views Education» more  CORR 1999»
15 years 10 days ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein