Sciweavers

1162 search results - page 75 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
COLT
2005
Springer
14 years 1 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed ā€œmanifold-motivatedā€...
Mikhail Belkin, Partha Niyogi
SCOPES
2004
Springer
14 years 1 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 8 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
COMPGEOM
2006
ACM
14 years 2 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
CRITIS
2007
13 years 9 months ago
An Analysis of Cyclical Interdependencies in Critical Infrastructures
Abstract In this paper we discuss the properties and algorithmic methods for the identiļ¬cation and classiļ¬cation of cyclical interdependencies in critical infrastructures based...
Nils Kalstad Svendsen, Stephen D. Wolthusen