Sciweavers

541 search results - page 57 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
73
Voted
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
15 years 5 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
16 years 38 min ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
JAR
2010
95views more  JAR 2010»
14 years 6 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
PODC
1999
ACM
15 years 4 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
OL
2008
79views more  OL 2008»
14 years 11 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky