Sciweavers

71 search results - page 13 / 15
» High capacity associative memories and connection constraint...
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 1 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
EUROSSC
2006
Springer
14 years 7 days ago
Towards Hovering Information
This paper introduces a new concept of information that can exist in a mobile environment with no fixed infrastructure and centralized servers, which we call the Hovering Informati...
Alfredo A. Villalba Castro, Dimitri Konstantas
IPPS
2010
IEEE
13 years 6 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
IJWMC
2007
84views more  IJWMC 2007»
13 years 8 months ago
Towards all-IP wireless networks: architectures and resource management mechanism
Future wireless Internet will consist of different wireless technologies that should operate together in an efficient way to provide seamless connectivity to mobile users. The in...
Majid Ghaderi, Raouf Boutaba
BMCBI
2005
162views more  BMCBI 2005»
13 years 8 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes