Sciweavers

1941 search results - page 202 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ARITH
2007
IEEE
16 years 25 days ago
Worst Cases of a Periodic Function for Large Arguments
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
Guillaume Hanrot, Vincent Lefèvre, Damien S...
INFOCOM
2007
IEEE
16 years 23 days ago
The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
Randeep Bhatia, Abhishek Kashyap, Erran L. Li
QEST
2007
IEEE
16 years 22 days ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
SMI
2007
IEEE
139views Image Analysis» more  SMI 2007»
16 years 22 days ago
Texture Atlas Generation for Inconsistent Meshes and Point Sets
In order to compute texture atlases with low stretch and hardly visible texture seams existing texture mapping tools pose high demands on the quality of surface representations li...
Patrick Degener, Reinhard Klein
ICFCA
2007
Springer
16 years 19 days ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos