Sciweavers

4009 search results - page 429 / 802
» Clustering on Complex Graphs
Sort
View
ICIP
2003
IEEE
16 years 8 months ago
Optimal erasure protection assignment for scalable compressed images with tree-structured dependencies
This paper is concerned with the efficient transmission of scalable compressed images with complex dependency structures over lossy communication channels. Our recent work propose...
Johnson Thie, David Taubman
COMPLEX
2009
Springer
16 years 1 months ago
Retail Location Choice with Complementary Goods: An Agent-Based Model
This paper examines the emergence of retail clusters on a supply chain network comprised of suppliers, retailers, and consumers. An agent-based model is proposed to investigate ret...
Arthur Huang, David Levinson
GECCO
2004
Springer
16 years 6 days ago
Using Interconnection Style Rules to Infer Software Architecture Relations
Software design techniques emphasize the use of abstractions to help developers deal with the complexity of constructing large and complex systems. These abstractions can also be u...
Brian S. Mitchell, Spiros Mancoridis, Martin Trave...
HIS
2004
15 years 8 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
NIPS
2003
15 years 8 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan