Sciweavers

2489 search results - page 45 / 498
» On the Subgroup Distance Problem
Sort
View
80
Voted
APPML
2006
71views more  APPML 2006»
15 years 27 days ago
Distance distribution of nodes in star graphs
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
L. Wang, S. Subramanian, Shahram Latifi, Pradip K....
CN
2007
117views more  CN 2007»
15 years 25 days ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
CVPR
2004
IEEE
15 years 4 months ago
Visual Object Categorization Using Distance-Based Discriminant Analysis
This paper formulates the problem of object categorization in the discriminant analysis framework focusing on transforming visual feature data so as to make it conform to the comp...
Serhiy Kosinov, Stéphane Marchand-Maillet, ...
124
Voted
COCOON
2005
Springer
15 years 6 months ago
Algorithms for Finding Distance-Edge-Colorings of Graphs
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishize...
ITICSE
2000
ACM
15 years 5 months ago
Distance tutorials in a systems design course
An experiment with distance technology in a secondyear Object-Oriented Systems Design course is described. Video and computer conferencing were used in tutorial sessions where a t...
Joakim von Wright