Sciweavers

243 search results - page 34 / 49
» On randomized representations of graphs using short labels
Sort
View
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 1 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
John E. Hopcroft, Daniel Sheldon
ACL
2009
13 years 5 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 7 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
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
13 years 7 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
CVPR
2010
IEEE
14 years 3 months ago
Automatic Discovery of Meaningful Object Parts with Latent CRFs
Object recognition is challenging due to high intra-class variability caused, e.g., by articulation, viewpoint changes, and partial occlusion. Successful methods need to strike a...
Paul Schnitzspan, Stefan Roth, Bernt Schiele