Sciweavers

745 search results - page 104 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
ICALT
2006
IEEE
15 years 6 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
15 years 6 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
133
Voted
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 2 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
IEEECIT
2006
IEEE
15 years 6 months ago
Improving Resiliency of Network Topology with Enhanced Evolving Strategies
— Recent studies have shown that many real networks follow the power-law distribution of node degrees. Instead of random connectivity, however, power-law connectivity suffers fro...
Soo Kim, Heejo Lee, Wan Yeon Lee
CVPR
2007
IEEE
15 years 7 months ago
Accurate Dynamic Sketching of Faces from Video
A sketch captures the most informative part of an object, in a much more concise and potentially robust representation (e.g., for face recognition or new capabilities of manipulat...
Zijian Xu, Jiebo Luo