Sciweavers

3708 search results - page 379 / 742
» The Inverse Classification Problem
Sort
View
182
Voted
COMBINATORICS
2000
120views more  COMBINATORICS 2000»
15 years 6 months ago
The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
Elias M. Hagos
DM
2000
73views more  DM 2000»
15 years 6 months ago
Some formulae for partitions into squares
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...
Michael D. Hirschhorn
INFORMATICALT
2000
118views more  INFORMATICALT 2000»
15 years 6 months ago
Generalization Error of Randomized Linear Zero Empirical Error Classifier: Simple Asymptotics for Centered Data Case
An estimation of the generalization performance of classifier is one of most important problems in pattern clasification and neural network training theory. In this paper we estima...
Valdas Diciunas, Sarunas Raudys
IHI
2010
219views Healthcare» more  IHI 2010»
15 years 1 months ago
Conditional random fields for activity recognition in smart environments
One of the most common functions of smart environments is to monitor and assist older adults with their activities of daily living. Activity recognition is a key component in this...
Ehsan Nazerfard, Barnan Das, Lawrence B. Holder, D...
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz