Sciweavers

4469 search results - page 433 / 894
» Dynamic Program Slicing
Sort
View
MVA
1998
15 years 8 months ago
Recognizing Buildings in Urban Scene of Distant View
This paper presents an approach for recognizing urban scene in distant views. Previously, we have developed a method using dynamic programming technique to recognize key buildings...
Peilin Liu, Katsushi Ikeuchi, Masao Sakauchi
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
IPL
2006
97views more  IPL 2006»
15 years 7 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
CORR
2007
Springer
147views Education» more  CORR 2007»
15 years 7 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
JSAC
2006
100views more  JSAC 2006»
15 years 7 months ago
An improved algorithm for optimal lightpath establishment on a tree topology
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...