5055 search results - page 346 / 1011 » Relative Timing |
207
click to vote
QEST
2009
IEEE
16 years 2 months ago
2009
IEEE
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
183
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
199
click to vote
SSDBM
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose an automatic method for modeling a relational database that uses SQL triggers and foreign-keys to efficiently answer positive semantic queries about ground instances for...
215
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
186
click to vote
SMC
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...