Sciweavers

4791 search results - page 103 / 959
» Clustering with partial information
Sort
View
DPD
2008
136views more  DPD 2008»
15 years 4 months ago
A cache invalidation scheme for continuous partial match queries in mobile computing environments
The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile client...
Yon Dohn Chung
ESWS
2009
Springer
15 years 2 months ago
Using Partial Reference Alignments to Align Ontologies
In different areas ontologies have been developed and many of these ontologies contain overlapping information. Often we would therefore want to be able to use multiple ontologies....
Patrick Lambrix, Qiang Liu 0002
HT
1996
ACM
15 years 8 months ago
HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering
HyPursuit is a new hierarchical network search engine that clusters hypertext documents to structure a given information space for browsing and search activities. Our content-link...
Ron Weiss, Bienvenido Vélez, Mark A. Sheldo...
DGO
2006
148views Education» more  DGO 2006»
15 years 6 months ago
Automatically labeling hierarchical clusters
Government agencies must often quickly organize and analyze large amounts of textual information, for example comments received as part of notice and comment rulemaking. Hierarchi...
Pucktada Treeratpituk, Jamie Callan
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
15 years 11 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert