Sciweavers

1285 search results - page 122 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICIP
2003
IEEE
14 years 11 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
14 years 4 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
14 years 3 months 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...
ACSC
2002
IEEE
14 years 3 months ago
Bandwidth Reservation Strategies for Mobility Support of Wireless Connections with QoS Guarantees
This paper examines QoS guarantees for bandwidth in mobile wireless networks, with a focus on reducing dropped connections on handoff. We can achieve this by reserving bandwidth f...
R. Hutchens, S. Singh
HIS
2004
13 years 11 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...