1330 search results - page 184 / 266 » No Classic Boundary Conditions |
219
click to vote
JMLR
2012
13 years 8 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
170
click to vote
AAAI
2012
13 years 8 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
183
click to vote
ICIP
2004
IEEE
16 years 7 months ago
2004
IEEE
In this work, we propose an unsupervised Bayesian model for the detection of moving objects from dynamic scenes. This unsupervised solution is a three-step approach that uses a st...
161
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
148
click to vote
ICMCS
2007
IEEE
16 years 17 days ago
2007
IEEE
We propose a discriminative learning approach for fusing multichannel sequential data with application to detect unsafe driving patterns from multi-channel driving recording data....