Sciweavers

13026 search results - page 2404 / 2606
» Probabilistic Relational Models
Sort
View
RSA
2010
89views more  RSA 2010»
15 years 2 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
SCP
2010
96views more  SCP 2010»
15 years 2 months ago
Enforcing structural regularities in software using IntensiVE
The design and implementation of a software system is often governed by a variety of coding conventions, design patterns, architectural guidelines, design rules, and other so-call...
Johan Brichau, Andy Kellens, Sergio Castro, Theo D...
SPIRE
2010
Springer
15 years 2 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
VTC
2010
IEEE
114views Communications» more  VTC 2010»
15 years 2 months ago
On Non-Stationary Urban Macrocell Channels in a Cooperative Downlink Beamforming Scenario
—A common simplification in the treatment of random linear channels is the assumption of stationarity of the channel in time. The wireless channel is, however, known to be inher...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 2 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
« Prev « First page 2404 / 2606 Last » Next »