Sciweavers

604 search results - page 26 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
SWAT
1998
Springer
84views Algorithms» more  SWAT 1998»
14 years 1 months ago
Models and Motion Planning
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
TVLSI
2008
90views more  TVLSI 2008»
13 years 8 months ago
A Special-Purpose Architecture for Solving the Breakpoint Median Problem
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
Jason D. Bakos, Panormitis E. Elenis
VTC
2006
IEEE
115views Communications» more  VTC 2006»
14 years 2 months ago
Suboptimal Maximum Likelihood Detection Using Gradient-based Algorithm for MIMO Channels
Abstract— This paper proposes a suboptimal maximum likelihood detection (MLD) algorithm for multiple-input multipleoutput (MIMO) communications. The proposed algorithm regards tr...
Thet Htun Khine, Kazuhiko Fukawa, Hiroshi Suzuki
ICCV
2007
IEEE
14 years 10 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 9 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims