Sciweavers

5922 search results - page 922 / 1185
» Navigability of Complex Networks
Sort
View
ICML
2004
IEEE
16 years 8 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
RECOMB
2005
Springer
16 years 7 months ago
Comparison of Protein-Protein Interaction Confidence Assignment Schemes
Recent technological advances have enabled high-throughput measurements of protein-protein interactions in the cell, producing protein interaction networks for various species at a...
Silpa Suthram, Tomer Shlomi, Eytan Ruppin, Roded S...
RECOMB
2003
Springer
16 years 7 months ago
Modeling dependencies in protein-DNA binding sites
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kap...
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
16 years 7 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...