Sciweavers

10414 search results - page 392 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
AAAI
2008
15 years 9 months ago
Efficient Learning of Action Schemas and Web-Service Descriptions
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
Thomas J. Walsh, Michael L. Littman
ECIR
2006
Springer
15 years 8 months ago
An Efficient Computation of the Multiple-Bernoulli Language Model
Abstract. The Multiple Bernoulli (MB) Language Model has been generally considered too computationally expensive for practical purposes and superseded by the more efficient multino...
Leif Azzopardi, David E. Losada
DAC
2005
ACM
16 years 7 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
GLOBECOM
2006
IEEE
16 years 22 days ago
User-Aided Adaptive TDMA for Real-Time Services in an OFDM Based Cellular System
—In this paper, a user-aided adaptive TDMA (UAAT) algorithm is developed for real-time services to improve the system efficiency of OFDM based cellular networks. In the UAAT sche...
Changqin Huo, Abu B. Sesay, Abraham O. Fapojuwo
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 3 months ago
From Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2
Dariusz Dereniowski