Sciweavers

3105 search results - page 296 / 621
» The Path-Packing Structure of Graphs
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
156
Voted
CORR
2012
Springer
188views Education» more  CORR 2012»
14 years 7 days ago
A Logical Characterization of Constraint-Based Causal Discovery
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
Tom Claassen, Tom Heskes
146
Voted
CVPR
2012
IEEE
13 years 7 months ago
Learning to localize detected objects
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
Qieyun Dai, Derek Hoiem
CIKM
2009
Springer
15 years 11 months ago
Privacy-enhanced public view for social graphs
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
Hyoungshick Kim, Joseph Bonneau
128
Voted
SIGCOMM
2009
ACM
15 years 11 months ago
Beyond friendship graphs: a study of user interactions in Flickr
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
Masoud Valafar, Reza Rejaie, Walter Willinger