Sciweavers

1368 search results - page 28 / 274
» Avoiding Simplicity Is Complex
Sort
View
SIAMIS
2010
116views more  SIAMIS 2010»
13 years 8 months ago
Higher-Order Feature-Preserving Geometric Regularization
We introduce two fourth-order regularization methods that remove geometric noise without destroying significant geometric features. These methods leverage ideas from image denoisi...
Marc Droske, Andrea Bertozzi
CONEXT
2010
ACM
13 years 7 months ago
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
In this paper, we explore a simple yet effective technique for explicitly allocating airtime to each active pair of communicating neighbors in a wireless neighborhood so that TCP ...
Ki-Young Jang, Konstantinos Psounis, Ramesh Govind...
COMPGEOM
1995
ACM
14 years 1 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
DAGSTUHL
2006
13 years 11 months ago
Approaches to Compute Workflow Complexity
-- During the last 20 years, complexity has been an interesting topic that has been investigated in many fields of science, such as biology, neurology, software engineering, chemis...
Jorge Cardoso
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 10 months ago
Effective Complexity and its Relation to Logical Depth
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
Nihat Ay, Markus Mueller, Arleta Szkola