We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Geographic information systems (GIS) must support large georeferenced data sets. Due to the size of these data sets finding exact answers to spatial queries can be very time consum...
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger