The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
In multi-instance learning, the training examples are bags composed of instances without labels, and the task is to predict the labels of unseen bags through analyzing the training...
We present a novel variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher dimensional space of distance transforms. In...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
Rex A. Kerr, Thomas M. Bartol, Boris Kaminsky, Mar...
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...