Sciweavers

1132 search results - page 203 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
PAMI
2006
164views more  PAMI 2006»
13 years 7 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 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...
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
TSP
2008
92views more  TSP 2008»
13 years 7 months ago
Distributed Structures, Sequential Optimization, and Quantization for Detection
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
Michael A. Lexa, Don H. Johnson
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