Sciweavers

982 search results - page 43 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
DAC
2006
ACM
15 years 11 months ago
Optimal jumper insertion for antenna avoidance under ratio upper-bound
Antenna effect may damage gate oxides during plasma-based fabrication process. The antenna ratio of total exposed antenna area to total gate oxide area is directly related to the ...
Jia Wang, Hai Zhou
SDM
2012
SIAM
238views Data Mining» more  SDM 2012»
13 years 9 days ago
Evaluating Event Credibility on Twitter
Though Twitter acts as a realtime news source with people acting as sensors and sending event updates from all over the world, rumors spread via Twitter have been noted to cause c...
Manish Gupta, Peixiang Zhao, Jiawei Han
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 3 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
SPAA
1993
ACM
15 years 2 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout
DCOSS
2005
Springer
15 years 3 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie