Sciweavers

3367 search results - page 312 / 674
» Incremental assignment problem
Sort
View
ICC
2000
IEEE
105views Communications» more  ICC 2000»
15 years 9 months ago
FDMA Capacity of the Gaussian Multiple Access Channel With ISI
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
Wei Yu, John M. Cioffi
143
Voted
LICS
1999
IEEE
15 years 8 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
CSCLP
2006
Springer
15 years 8 months ago
Extracting Microstructure in Binary Constraint Networks
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
Chavalit Likitvivatanavong, Roland H. C. Yap
162
Voted
ECCV
2010
Springer
15 years 7 months ago
Simultaneous Segmentation and Figure/Ground Organization using Angular Embedding
Abstract. Image segmentation and figure/ground organization are fundamental steps in visual perception. This paper introduces an algorithm that couples these tasks together in a s...
COCOON
2006
Springer
15 years 6 months ago
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...