Sciweavers

1650 search results - page 288 / 330
» The HOM problem is decidable
Sort
View
RTA
2007
Springer
14 years 1 months ago
The Termination Competition
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...
Claude Marché, Hans Zantema
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 1 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
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...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
PDC
2004
ACM
14 years 1 months ago
Lost in translation: a critical analysis of actors, artifacts, agendas, and arenas in participatory design
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...
Rogério De Paula
ECAI
2004
Springer
14 years 1 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
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...
María Dolores Rodríguez-Moreno, Ange...
GD
2003
Springer
14 years 27 days ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
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...
Alon Efrat, Cesim Erten, Stephen G. Kobourov