Sciweavers

495 search results - page 72 / 99
» Probability Trees
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 10 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
AEI
2007
119views more  AEI 2007»
13 years 8 months ago
Anxiety-based affective communication for implicit human-machine interaction
: An implicit human-machine interaction communication framework that is sensitive to human affective states is presented. The overall goal is to achieve detection and recognition o...
Pramila Rani, Nilanjan Sarkar, Julie Adams
EJC
2008
13 years 8 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
CSDA
2006
100views more  CSDA 2006»
13 years 8 months ago
Identification of interaction patterns and classification with applications to microarray data
Emerging patterns represent a class of interaction structures which has been recently proposed as a tool in data mining. In this paper, a new and more general definition refering ...
Anne-Laure Boulesteix, Gerhard Tutz
ENTCS
2007
123views more  ENTCS 2007»
13 years 8 months ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell