Sciweavers

581 search results - page 65 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
JMLR
2010
156views more  JMLR 2010»
13 years 2 months ago
Classification with Incomplete Data Using Dirichlet Process Priors
A non-parametric hierarchical Bayesian framework is developed for designing a classifier, based on a mixture of simple (linear) classifiers. Each simple classifier is termed a loc...
Chunping Wang, Xuejun Liao, Lawrence Carin, David ...
SARA
2005
Springer
14 years 1 months ago
The Cruncher: Automatic Concept Formation Using Minimum Description Length
Abstract. We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attrib...
Marc Pickett, Tim Oates
INFOCOM
2010
IEEE
13 years 5 months ago
FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
Masanori Bando, H. Jonathan Chao
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 8 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
ICPR
2004
IEEE
14 years 8 months ago
Extraction and Clustering of Motion Trajectories in Video
A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clus...
Dan Buzan, George Kollios, Stan Sclaroff