Sciweavers

4926 search results - page 227 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
SIGIR
2012
ACM
13 years 8 months ago
An uncertainty-aware query selection model for evaluation of IR systems
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
Mehdi Hosseini, Ingemar J. Cox, Natasa Milic-Frayl...
CSE
2009
IEEE
15 years 4 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
ICPR
2006
IEEE
16 years 7 months ago
Estimating the location of illuminants in realist master paintings Computer image analysis addresses a debate in art history of
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...
154
Voted
LATIN
2010
Springer
16 years 1 months ago
Some Observations on Holographic Algorithms
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
Leslie G. Valiant