Sciweavers

1027 search results - page 14 / 206
» Ordered Vertex Partitioning
Sort
View
PDCAT
2004
Springer
14 years 25 days ago
An In-Order SMT Architecture with Static Resource Partitioning for Consumer Applications
Abstract. This paper proposes a simplified simultaneous multithreading (SMT) architecture aiming at CPU cores of embedded SoCs for consumer applications. This architecture reduces...
Byung In Moon, Hongil Yoon, Ilgun Yun, Sungho Kang
ICIP
2010
IEEE
13 years 5 months ago
Comparison of merging orders and pruning strategies for Binary Partition Tree in hyperspectral data
Hyperspectral imaging segmentation has been an active research area over the past few years. Despite the growing interest, some factors such as high spectrum variability are still...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
MOBICOM
2009
ACM
14 years 2 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
ICASSP
2011
IEEE
12 years 11 months ago
Occlusion-based depth ordering on monocular images with Binary Partition Tree
This paper proposes a system to relate objects in an image using occlusion cues and arrange them according to depth. The system does not rely on any a priori knowledge of the scen...
Guillem Palou, Philippe Salembier
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 8 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber