7380 search results - page 309 / 1476 » time 2008 |
151
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a method for merging multiple partitions into a single partition, by minimising the ratio of pairwise agreements and contradictions between the equivalence relations cor...
160
click to vote
COMAD
2008
15 years 8 months ago
2008
In this paper we present algorithms for identifying interesting subsets of a given database of records. In many real life applications, it is important to automatically discover s...
201
click to vote
TRECVID
2007
15 years 7 months ago
2007
The INESC Porto group has participated in the search task (automatic and interactive). Our approach combines high-level features (the 39 concepts of the LSCOM-Lite set) with low-l...
201
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
We consider a discrete time state estimation problem over a packet-based network. In each discrete time step, a measurement packet is sent across a lossy network to an estimator u...
145
click to vote
DM
2008
15 years 6 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...