Sciweavers

6142 search results - page 524 / 1229
» The Complexity of Partition Functions
Sort
View
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 7 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
CVPR
2006
IEEE
16 years 9 months ago
Reconstructing Occluded Surfaces Using Synthetic Apertures: Stereo, Focus and Robust Measures
Most algorithms for 3D reconstruction from images use cost functions based on SSD, which assume that the surfaces being reconstructed are visible to all cameras. This makes it dif...
Vaibhav Vaish, Marc Levoy, Richard Szeliski, C. La...
SIGMOD
2004
ACM
120views Database» more  SIGMOD 2004»
16 years 7 months ago
Prediction and Indexing of Moving Objects with Unknown Motion Patterns
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias, ...
ICCD
2006
IEEE
185views Hardware» more  ICCD 2006»
16 years 3 months ago
An accurate Energy estimation framework for VLIW Processor Cores
— In this paper, we present a comprehensive energy estimation framework for software executing on Very Long Instruction Word (VLIW) processor cores. The proposed energy model is ...
Sourav Roy, Rajat Bhatia, Ashish Mathur
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
16 years 1 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur