History
1
174


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 174 total

Performance evaluation with hidden Markov models (English)
PERFORM, 112-128 (2010).
WorldCat.org
1
Geometric bounds: A noniterative analysis technique for closed queueing networks. (English)
IEEE Trans. Comput. 57, No. 06, 780-794 (2008).
WorldCat.org
2
Geometric bounds: A noniterative analysis technique for closed queueing networks (English)
IEEE Trans. Computers 57, No. 6, 780-794 (2008).
WorldCat.org
3
Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. (English)
Knowl. Inf. Syst. 10, No. 3, 265-294 (2006).
WorldCat.org
4
Modeling, analysis, measurement and experimentation with the tangram-II integrated environment (English)
VALUETOOLS, 7 (2006).
WorldCat.org
5
A new class of non-iterative bounds for closed queueing networks (English)
MASCOTS, 69-76 (2006).
WorldCat.org
6
Tunnel vector: A new routing algorithm with scalability (English)
INFOCOM (2006).
WorldCat.org
7
Peer clustering: a hybrid approach to distributed virtual environments (English)
NETGAMES, 11 (2006).
WorldCat.org
8
Correction to "Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees". (English)
IEEE Transactions on Knowledge and Data Engineering 17, No.12, 1737 (2005).
WorldCat.org
9
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees. (English)
IEEE Transactions on Knowledge and Data Engineering 17, No.02, 190-202 (2005).
WorldCat.org
10
Frequent subtree mining ‒ an overview. (English)
Fundam. Inform. 66, No. 1-2, 161-198 (2005).
WorldCat.org
11
Canonical forms for labelled trees and their applications in frequent subtree mining. (English)
Knowl. Inf. Syst. 8, No. 2, 203-234 (2005).
WorldCat.org
12
Correction to "mining closed and maximal frequent subtrees from databases of labeled rooted trees" (English)
IEEE Trans. Knowl. Data Eng. 17, No. 12, 1737 (2005).
WorldCat.org
13
Mining closed and maximal frequent subtrees from databases of labeled rooted trees (English)
IEEE Trans. Knowl. Data Eng. 17, No. 2, 190-202 (2005).
WorldCat.org
14
Loadstar: A load shedding scheme for classifying data streams (English)
SDM (2005).
WorldCat.org
15
On-demand overlay networking of collaborative applications (English)
CollaborateCom (2005).
WorldCat.org
16
Image Retrieval Using Multiple Evidence Ranking. (English)
IEEE Transactions on Knowledge and Data Engineering 16, No.04, 408-417 (2004).
WorldCat.org
17
Image retrieval using multiple evidence ranking (English)
IEEE Trans. Knowl. Data Eng. 16, No. 4, 408-417 (2004).
WorldCat.org
18
Moment: maintaining closed frequent itemsets over a stream sliding window (English)
ICDM, 59-66 (2004).
WorldCat.org
19
Cmtreeminer: mining both closed and maximal frequent subtrees (English)
PAKDD, 63-73 (2004).
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 174 total

Valid XHTML 1.0 Transitional Valid CSS!