Sciweavers

3874 search results - page 407 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
16 years 26 days ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
16 years 5 days ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eļ¬...
Bram De Wachter, Alexandre Genon, Thierry Massart
AAIM
2005
Springer
81views Algorithms» more  AAIM 2005»
15 years 8 months ago
Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
Xiao-Dong Hu, Tianping Shuai
COMPGEOM
2005
ACM
15 years 8 months ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr“echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof