Sciweavers

32545 search results - page 56 / 6509
» Data Structures and Algorithms
Sort
View
TNN
1998
123views more  TNN 1998»
15 years 2 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
128
Voted
CORR
2010
Springer
193views Education» more  CORR 2010»
15 years 1 months ago
A Probabilistic Approach for Learning Folksonomies from Structured Data
Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach t...
Anon Plangprasopchok, Kristina Lerman, Lise Getoor
BMCBI
2008
123views more  BMCBI 2008»
15 years 2 months ago
PocketMatch: A new algorithm to compare binding sites in protein structures
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...
Kalidas Yeturu, Nagasuma Chandra
HIPC
2004
Springer
15 years 7 months ago
Lock-Free Parallel Algorithms: An Experimental Study
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
Guojing Cong, David A. Bader
115
Voted
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 3 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola