Sciweavers

1149 search results - page 198 / 230
» Minimally non-Pfaffian graphs
Sort
View
CONEXT
2009
ACM
15 years 28 days ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
RPTEL
2006
75views more  RPTEL 2006»
14 years 11 months ago
A Qualitative Analysis of Collaborative Knowledge Construction through Shared Representations
This paper takes one step towards addressing the question of how activity mediated by shared representations--notations that are manipulated by more than one person during a collab...
Daniel D. Suthers
JCB
2007
118views more  JCB 2007»
14 years 11 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
ECCV
2008
Springer
16 years 1 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
DAC
2006
ACM
16 years 24 days ago
Optimality study of resource binding with multi-Vdds
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
Deming Chen, Jason Cong, Yiping Fan, Junjuan Xu