Sciweavers

1591 search results - page 272 / 319
» Random lifts of graphs
Sort
View
JSA
2007
191views more  JSA 2007»
14 years 11 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
ALGOSENSORS
2009
Springer
14 years 9 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
ICWSM
2009
14 years 9 months ago
Content Based Recommendation and Summarization in the Blogosphere
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
Ahmed Hassan, Dragomir R. Radev, Junghoo Cho, Amru...
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
16 years 4 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
CVPR
2004
IEEE
16 years 1 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher