Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...
Memory is one of the most restricted resources in many modern embedded systems. Code compression can provide substantial savings in terms of size. In a compressed code CPU, a cach...
Little is known about the impact of politeness in online communities. This project combines deductive and inductive approaches to automatically model linguistic politeness in onli...