900 search results - page 20 / 180 » On Polynomial Time Computation over Unordered Structures |
110
click to vote
ALENEX
2004
15 years 3 months ago
2004
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...
122
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
123
click to vote
DCC
2011
IEEE
14 years 9 months ago
2011
IEEE
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
122
click to vote
ISSAC
1997
Springer
15 years 6 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
108
click to vote
ICCSA
2007
Springer
15 years 8 months ago
2007
Springer
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...