Sciweavers

950 search results - page 17 / 190
» Modified global k
Sort
View
TSP
2010
14 years 8 months ago
Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming
In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimizati...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Lamia ...
FOCS
2007
IEEE
15 years 5 months ago
Local Global Tradeoffs in Metric Embeddings
Suppose that every k points in a n point metric space X are D-distortion embed
Moses Charikar, Konstantin Makarychev, Yury Makary...
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 11 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
ISAAC
2009
Springer
87views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Parameterizing Cut Sets in a Graph by the Number of Their Components
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
Takehiro Ito, Marcin Kaminski, Daniël Paulusm...
PODC
2009
ACM
16 years 2 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...