Sciweavers

1730 search results - page 177 / 346
» Algebra and Computation
Sort
View
MFCS
2007
Springer
15 years 10 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
MDM
2005
Springer
117views Communications» more  MDM 2005»
15 years 9 months ago
Tuning query performance in mobile sensor databases
In this paper we propose a query-driven approach for tuning the time/energy trade-off in sensor networks with mobile sensors. The tuning factors include re-positioning of mobile s...
Vladimir Zadorozhny, Divyasheel Sharma, Prashant K...
VIP
2001
15 years 5 months ago
Image Segmentation on Spiral Architecture
Spiral Architecture is a relatively new and powerful approach to general purpose machine vision system. It contains very useful geometric and algebraic properties. Two algebraic o...
Qiang Wu, Xiangjian He, Tom Hintz
AAECC
2010
Springer
132views Algorithms» more  AAECC 2010»
15 years 4 months ago
On the geometry of polar varieties
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...
Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey ...
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 4 months ago
Programming an interpreter using molecular dynamics
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
Jan A. Bergstra, C. A. Middelburg