Sciweavers

1074 search results - page 96 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
FLAIRS
2004
14 years 11 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang
CP
2006
Springer
15 years 1 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
SAMT
2009
Springer
176views Multimedia» more  SAMT 2009»
15 years 4 months ago
Shape-Based Autotagging of 3D Models for Retrieval
This paper describes an automatic annotation, or autotagging, algorithm that attaches textual tags to 3D models based on their shape and semantic classes. The proposed method emplo...
Ryutarou Ohbuchi, Shun Kawamura
ICPP
1999
IEEE
15 years 2 months ago
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
Chi-Hsiang Yeh, Behrooz Parhami