Sciweavers

603 search results - page 98 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
FOCS
2008
IEEE
15 years 6 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
15 years 6 months ago
Load Shedding for Window Joins on Multiple Data Streams
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
Yan-Nei Law, Carlo Zaniolo
MFCS
2005
Springer
15 years 5 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
INFOCOM
2003
IEEE
15 years 5 months ago
Improving Web Performance in Broadcast-Unicast Networks
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Sriniv...
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 3 months ago
Multi-objective optimization tool for a free structure analog circuits design using genetic algorithms and incorporating parasit
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
Yaser M. A. Khalifa, Badar K. Khan, Faisal Taha