Sciweavers

43264 search results - page 8324 / 8653
» Comparing models of computation
Sort
View
SPIRE
2010
Springer
15 years 1 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
SSPR
2010
Springer
15 years 1 months ago
A Psychophysical Evaluation of Texture Degradation Descriptors
Delivering digitally a realistic appearance of materials is one of the most difficult tasks of computer vision. Accurate representation of surface texture can be obtained by means ...
Jirí Filip, Pavel Vácha, Michal Hain...
TCOM
2010
141views more  TCOM 2010»
15 years 1 months ago
Communications over the Best Singular Mode of a Reciprocal MIMO Channel
We consider two nodes equipped with multiple antennas that intend to communicate i.e. both of which transmit and receive data. We model the responses of the communication channels...
Saeed Gazor, Khalid AlSuhaili
TOPLAS
2010
93views more  TOPLAS 2010»
15 years 1 months ago
Semantics of fractional permissions with nesting
Fractional permissions use fractions to distinguish write access (1) from read access (any smaller fraction). Nesting (an extension of adoption) can be used to model object invari...
John Tang Boyland
TOSN
2010
106views more  TOSN 2010»
15 years 1 months ago
On boundary recognition without location information in wireless sensor networks
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
Olga Saukh, Robert Sauter, Matthias Gauger, Pedro ...
« Prev « First page 8324 / 8653 Last » Next »