Sciweavers

620 search results - page 56 / 124
» Likelihood Computations Using Value Abstraction
Sort
View
WCNC
2008
IEEE
14 years 4 months ago
Locate More Nodes in Under Water Sensor Networks Using Out-of-Range Information
Abstract—The sparse network topology, coupled with the limited availability of reference nodes in Under Water Sensor Network (UWSN), significantly reduces the effectiveness of m...
Hui Ling, Taieb Znati
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
14 years 3 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
ICDS
2010
IEEE
14 years 3 months ago
Modeling and Analysis of Laws Using BPR and Goal-Oriented Framework
Abstract—Recently, two complementary approaches are proposed to represent, model and analyze laws: the Nomos and VLPM approaches. Nomos is a goal-oriented approach to effectively...
Adolfo Villafiorita, Komminist Weldemariam, Angelo...
ROOM
2000
13 years 11 months ago
Checking the Consistency of UML Class Diagrams Using Larch Prover
The Unified Modeling Language (UML) has been designed to be a full standard notation for Object-Oriented Modelling. UML is a rather complete set of notations, but it lacks of form...
Pascal André, Annya Romanczuk, Jean-Claude ...
TASLP
2010
118views more  TASLP 2010»
13 years 8 months ago
Time-Frequency Sparsity by Removing Perceptually Irrelevant Components Using a Simple Model of Simultaneous Masking
Abstract—We present an algorithm for removing timefrequency components, found by a standard Gabor transform, of a “real-world” sound while causing no audible difference to th...
Péter Balázs, Bernhard Laback, Gerha...