Sciweavers

4865 search results - page 511 / 973
» The Complexity of Graph Connectivity
Sort
View
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
16 years 1 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
CIKM
2010
Springer
15 years 2 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
ICMCS
2008
IEEE
148views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Loss tolerance scheme for 3D progressive meshes streaming over networks
– Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of...
Hui Li, Ziying Tang, Xiaohu Guo, Balakrishnan Prab...
ISOLA
2010
Springer
15 years 5 months ago
Towards a Connector Algebra
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
Marco Autili, Chris Chilton, Paola Inverardi, Mart...
IACR
2011
152views more  IACR 2011»
14 years 6 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa