Sciweavers

251 search results - page 48 / 51
» Polynomial Time Algorithms for Three-Label Point Labeling
Sort
View
FOCS
1992
IEEE
13 years 11 months ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 9 months ago
On a Generalization of the Master Cyclic Group Polyhedron
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günl&uu...
STAIRS
2008
143views Education» more  STAIRS 2008»
13 years 9 months ago
Domain-Dependent View of Multiple Robots Path Planning
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
Pavel Surynek
SIGSOFT
2004
ACM
14 years 8 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 11 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson