Block graphs are graphs in which every block (biconnected component) is a clique. A graph G = (V,E) is said to be an (unpartitioned) probe block graph if there exists an independent set N ⊆ V and some set E′ ⊆ (N 2 ) such that the graph G′ = (V,E∪E′) is a block graph; if an independent set N is given, G is called a partitioned block graph. In this note we give good characterizations for probe b...

In this paper, we present a novel method for editing stylistic human motions. We represent styles as differences between stylistic motions and introduced neutral motions, including timing differences and spatial differences. Timing differences are defined as time alignment curves, while spatial differences are found by a machine learning technique: Independent Feature Subspaces Analysis, which ...

The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, a...

We have previously shown that classification of single-trial electroencephalographic (EEG) recordings is improved by the use of either a niultichannel classifier or the best independent component over a single channel classifier. In this paper, we introduce a classifier that makes explicit use of multiple independent components. Two models are compared. The first ("direct") model uses independe...

An exploratory study is described in which the same text was presented to subjects in one of four formats, of which two were hypertext (TIES and Hypercard) and two were linear (Word Processor and paper). Subjects were required to use the text to answer 12 questions. Measurement was made of their time and accuracy and their movement through the document was recorded, in addition to a variety of ...

We consider the unit-demand min-buying pricing problem, in which we want to compute revenue maximizing prices for a set of products P assuming that each consumer from a set of consumer samples C will purchase her cheapest affordable product once prices are fixed. We focus on the special uniform-budget case, in which every consumer has only a single non-zero budget for some set of products. This...

Themaximum independent set problem (MAXIS) on general graphs is known to beNPhard to approximate within a factor of n1−ǫ, for any ǫ > 0. However, there are many “easy” classes of graphs on which the problem can be solved in polynomial time. In this context, an interesting question is that of computing the maximum independent set in a graph that can be expressed as the union of a small number of...

An independent set Ic is a critical independent set if |Ic|−|N(Ic)| ≥ |J | − |N(J)|, for any independent set J . The critical independence number of a graph is the cardinality of a maximum critical independent set. This number is a lower bound for the independence number and can be computed in polynomial-time. Any graph can be decomposed into two subgraphs where the independence number of one s...

We consider the problem of providing a resolution proof of the statement that a given graph with n vertices and A n edges does not contain an independent set of size k. For randomly chosen graphs with constant A, we show that such proofs almost surely require size exponential in n. Further; f o r A = o(n1f5) and any k 5 n/5, we show that these proofs almost surely require size 2”‘ for some glob...

We present a novel probabilistic rating system for team competitions. Building upon TrueSkill, we change the factor graph structure to cope with the problems of TrueSkill, e.g., multiway ties and variable team size. We give detailed inference algorithms for the new structure. Experimental results show a significant improvement over TrueSkill.