1650 search results - page 288 / 330 » The HOM problem is decidable |
124
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
185
Voted
TCC
2007
Springer
15 years 10 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
155
click to vote
PDC
2004
ACM
15 years 9 months ago
2004
ACM
As computer technologies start to permeate the everyday activities of a continuously growing population, social and technical as well as political and legal issues will surface. P...
136
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
134
Voted
GD
2003
Springer
15 years 9 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...