Sciweavers

1399 search results - page 109 / 280
» New Algorithms for k-Center and Extensions
Sort
View
FLAIRS
2009
13 years 6 months ago
Maintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning
In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
Ronald Alford, Ugur Kuter, Dana S. Nau, Elnatan Re...
ICASSP
2009
IEEE
13 years 6 months ago
Fast belief propagation process element for high-quality stereo estimation
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
Chao-Chung Cheng, Chia-Kai Liang, Yen-Chieh Lai, H...
COLOGNETWENTE
2010
13 years 5 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
DCC
2011
IEEE
13 years 4 months ago
Color Image Compression Using a Learned Dictionary of Pairs of Orthonormal Bases
We present a new color image compression algorithm for RGB images. In our previous work [6], we presented a machine learning technique to derive a dictionary of orthonormal basis ...
Xin Hou, Karthik S. Gurumoorthy, Ajit Rajwade
IS
2011
13 years 4 months ago
Checking determinism of XML Schema content models in optimal time
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
Pekka Kilpeläinen