Sciweavers

99 search results - page 11 / 20
» Stable normal forms for polynomial system solving
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 11 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
GIS
2004
ACM
14 years 8 months ago
Time-dependent affine triangulation of spatio-temporal data
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
Sofie Haesevoets, Bart Kuijpers
ISCAS
2003
IEEE
97views Hardware» more  ISCAS 2003»
14 years 23 days ago
A multi-level static memory cell
This paper introduces a static multi-level memory cell that was conceived to store state variables in neuromorphic onchip learning applications. It consists of a capacitance that ...
Philipp Häfliger, Håvard Kolle Riis
IACR
2011
124views more  IACR 2011»
12 years 7 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm