Sciweavers

9949 search results - page 1619 / 1990
» On the Network Complexity of Selection
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Unsupervised modeling of object categories using link analysis techniques
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
Gunhee Kim, Christos Faloutsos, Martial Hebert
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 8 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
ICML
2004
IEEE
16 years 7 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...
« Prev « First page 1619 / 1990 Last » Next »