The amount of data exponentially increases in information systems and it becomes more and more difficult to extract the most relevant information within a very short time. Among ot...
Abstract. Multidimensional dynamic logic programs (MDLPs) are suitable to represent knowledge dynamic in time, or more generally, information coming from various sources, partially...
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
We describe an algorithm for automatically learning discriminative components of objects with SVM classifiers. It is based on growing image parts by minimizing theoretical bounds ...
Bernd Heisele, Thomas Serre, Massimiliano Pontil, ...
To realize personalized web services and to design adaptable systems it is necessary to have a possibility for modeling the user’s environment and preferences. A common approach...
Peter Dornbusch, Michael Fahrmair, Eiman Mohyeldin...