Sciweavers

219 search results - page 37 / 44
» Maximum common subgraph: some upper bound and lower bound re...
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 8 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
TSMC
2010
13 years 3 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ICALP
2009
Springer
14 years 8 months ago
Functional Monitoring without Monotonicity
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
Chrisil Arackaparambil, Joshua Brody, Amit Chakrab...
CCE
2004
13 years 8 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
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
14 years 2 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...