Sciweavers

3708 search results - page 684 / 742
» Approximating Betweenness Centrality
Sort
View
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
14 years 10 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...
POPL
2007
ACM
14 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
POPL
2006
ACM
14 years 10 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
RECOMB
2007
Springer
14 years 10 months ago
Free Energy Estimates of All-Atom Protein Structures Using Generalized Belief Propagation
We present a technique for approximating the free energy of protein structures using Generalized Belief Propagation (GBP). The accuracy and utility of these estimates are then demo...
Hetunandan Kamisetty, Eric P. Xing, Christopher Ja...
RECOMB
2006
Springer
14 years 10 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...