Sciweavers

376 search results - page 65 / 76
» Betweenness Centrality : Algorithms and Lower Bounds
Sort
View
AAAI
2008
13 years 10 months ago
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
Yong Gao
CCE
2004
13 years 7 months ago
New measures and procedures to manage financial risk with applications to the planning of gas commercialization in Asia
This paper presents some new concepts and procedures for financial risk management. To complement the use of value at risk a new concept, upside potential or opportunity value as ...
Ahmed Aseeri, Miguel J. Bagajewicz
EUROSYS
2011
ACM
12 years 11 months ago
Symbolic crosschecking of floating-point and SIMD code
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
Peter Collingbourne, Cristian Cadar, Paul H. J. Ke...
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
13 years 11 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...