Sciweavers

2612 search results - page 426 / 523
» Switching Graphs and Their Complexity
Sort
View
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
14 years 4 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
CIKM
2009
Springer
14 years 4 months ago
Interactive, topic-based visual text summarization and analysis
We are building an interactive, visual text analysis tool that aids users in analyzing a large collection of text. Unlike existing work in text analysis, which focuses either on d...
Shixia Liu, Michelle X. Zhou, Shimei Pan, Weihong ...
LICS
2008
IEEE
14 years 4 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
14 years 3 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
MOBICOM
2005
ACM
14 years 3 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang