Sciweavers

1728 search results - page 334 / 346
» Social Computing: Fundamentals and applications
Sort
View
CSB
2004
IEEE
112views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Reasoning about Molecular Similarity and Properties
Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notio...
Rahul Singh
BIOADIT
2006
Springer
15 years 1 months ago
Robot Control: From Silicon Circuitry to Cells
Life-like adaptive behaviour is so far an illusive goal in robot control. A capability to act successfully in a complex, ambiguous, and harsh environment would vastly increase the ...
Soichiro Tsuda, Klaus-Peter Zauner, Yukio-Pegio Gu...
86
Voted
CASES
2008
ACM
14 years 11 months ago
Efficiency and scalability of barrier synchronization on NoC based many-core architectures
Interconnects based on Networks-on-Chip are an appealing solution to address future microprocessor designs where, very likely, hundreds of cores will be connected on a single chip...
Oreste Villa, Gianluca Palermo, Cristina Silvano
CCS
2008
ACM
14 years 11 months ago
Towards provable secure neighbor discovery in wireless networks
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
14 years 11 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo