4843 search results - page 816 / 969 » The Shortcut Problem - Complexity and Approximation |
111
click to vote
AUSDM
2007
Springer
15 years 9 months ago
2007
Springer
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
125
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
104
click to vote
GFKL
2007
Springer
15 years 9 months ago
2007
Springer
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
123
Voted
ICB
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...
105
click to vote
ICFCA
2007
Springer
15 years 9 months ago
2007
Springer
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...