Sciweavers

4539 search results - page 800 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICAIL
2005
ACM
15 years 9 months ago
Effective Document Clustering for Large Heterogeneous Law Firm Collections
Computational resources for research in legal environments have historically implied remote access to large databases of legal documents such as case law, statutes, law reviews an...
Jack G. Conrad, Khalid Al-Kofahi, Ying Zhao, Georg...
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
15 years 9 months ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
PRICAI
2004
Springer
15 years 9 months ago
Shape Matching for Robot Mapping
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
Diedrich Wolter, Longin Jan Latecki
ICNP
2003
IEEE
15 years 9 months ago
Matchmaker: Signaling for Dynamic Publish/Subscribe Applications
The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscr...
Zihui Ge, Ping Ji, James F. Kurose, Donald F. Tows...
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
15 years 9 months ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...