Sciweavers

4190 search results - page 483 / 838
» Type Class Directives
Sort
View
MOC
2002
118views more  MOC 2002»
15 years 6 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
TMC
2010
158views more  TMC 2010»
15 years 5 months ago
Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
Murtuza Jadliwala, Sheng Zhong, Shambhu J. Upadhya...
CORR
2010
Springer
342views Education» more  CORR 2010»
15 years 4 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
BMCBI
2011
15 years 1 months ago
R2R - software to speed the depiction of aesthetic consensus RNA secondary structures
Background: With continuing identification of novel structured noncoding RNAs, there is an increasing need to create schematic diagrams showing the consensus features of these mol...
Zasha Weinberg, Ronald R. Breaker
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 9 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh