Sciweavers

1388 search results - page 257 / 278
» Approximability of Robust Network Design
Sort
View
ECCV
2006
Springer
14 years 11 months ago
Learning Nonlinear Manifolds from Time Series
Abstract. There has been growing interest in developing nonlinear dimensionality reduction algorithms for vision applications. Although progress has been made in recent years, conv...
Ruei-Sung Lin, Che-Bin Liu, Ming-Hsuan Yang, Naren...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 10 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
14 years 6 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
ICDCS
2007
IEEE
14 years 4 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
ISCAS
2007
IEEE
179views Hardware» more  ISCAS 2007»
14 years 4 months ago
Analysis for Signal and Power Integrity Using the Multilayered Finite Difference Method
— We present a method for fast analysis of signal and power integrity based on a recently developed multilayered finite difference method (M-FDM). In order to accurately model m...
Ege Engin, Krishna Bharath, Madhavan Swaminathan