1387 search results - page 139 / 278 » Convexity in Discrete Space |
IROS
2007
IEEE
14 years 4 months ago
2007
IEEE
— What would it be like if we could give our robot high level commands and it would automatically execute them in a verifiably correct fashion in dynamically changing environmen...
NIPS
2007
13 years 11 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
TON
2008
13 years 10 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
SIAMJO
2011
13 years 29 days ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...