Sciweavers

4565 search results - page 278 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
158
Voted
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 1 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 4 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 5 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
73
Voted
IJCAI
1989
15 years 1 months ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain
COLOGNETWENTE
2010
14 years 11 months ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey