Sciweavers

260 search results - page 39 / 52
» Resolution Complexity of Independent Sets in Random Graphs
Sort
View
WWW
2011
ACM
14 years 4 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
15 years 10 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
PAMI
2010
174views more  PAMI 2010»
14 years 8 months ago
Image Segmentation with a Unified Graphical Model
—We propose a unified graphical model that can represent both the causal and noncausal relationships among random variables and apply it to the image segmentation problem. Specif...
Lei Zhang 0011, Qiang Ji
DSD
2010
IEEE
110views Hardware» more  DSD 2010»
14 years 9 months ago
A Predictable Multiprocessor Design Flow for Streaming Applications with Dynamic Behaviour
—The design of new embedded systems is getting more and more complex as more functionality is integrated into these systems. To deal with the design complexity, a predictable des...
Sander Stuijk, Marc Geilen, Twan Basten
MICCAI
2010
Springer
14 years 8 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu