Sciweavers

234 search results - page 46 / 47
» Lightweight Task Graph Inference for Distributed Application...
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
SIGCOMM
2006
ACM
14 years 1 months ago
SybilGuard: defending against sybil attacks via social networks
Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake ident...
Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, ...
ICCV
2007
IEEE
14 years 9 months ago
The Best of Both Worlds: Combining 3D Deformable Models with Active Shape Models
Reliable 3D tracking is still a difficult task. Most parametrized 3D deformable models rely on the accurate extraction of image features for updating their parameters, and are pro...
Christian Vogler, Zhiguo Li, Atul Kanaujia, Siome ...
WEBDB
2010
Springer
178views Database» more  WEBDB 2010»
14 years 14 days ago
Using Latent-Structure to Detect Objects on the Web
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
Luciano Barbosa, Juliana Freire
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 11 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han