4894 search results - page 680 / 979 » The Guarding Problem - Complexity and Approximation |
126
click to vote
ISSAC
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
145
click to vote
VLSM
2005
Springer
15 years 9 months ago
2005
Springer
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
124
click to vote
DMSN
2004
ACM
15 years 9 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
133
click to vote
ATAL
2004
Springer
15 years 9 months ago
2004
Springer
The paper describes the architecture of Brown University’s agent, Botticelli, a finalist in the 2003 Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM,...
114
click to vote
AUSAI
2004
Springer
15 years 9 months ago
2004
Springer
One problem many Web users encounter is to keep track of changes of distant Web sources. Push services, informing clients about data changes, are frequently not provided by Web ser...