Sciweavers

528 search results - page 77 / 106
» Degrees of categoricity of computable structures
Sort
View
SPAA
2010
ACM
14 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
SGP
2007
13 years 11 months ago
Robust statistical estimation of curvature on discretized surfaces
A robust statistics approach to curvature estimation on discretely sampled surfaces, namely polygon meshes and point clouds, is presented. The method exhibits accuracy, stability ...
Evangelos Kalogerakis, Patricio D. Simari, Derek N...
APGV
2006
ACM
138views Visualization» more  APGV 2006»
13 years 10 months ago
Verification of rendering quality from measured BTFs
One of the most important, still unsolved problems in computer graphics is the generation of predictive imagery, i.e., images that represent perfect renditions of reality. Such pe...
Jan Meseth, Gero Müller, Reinhard Klein, Flor...
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 8 months ago
A computationally-efficient construction for the matrix-based key distribution in sensor network
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high d...
Abedelaziz Mohaisen
ICALP
2007
Springer
14 years 2 months ago
Model Theory Makes Formulas Large
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...