Sciweavers

1998 search results - page 333 / 400
» Complexity of the Cover Polynomial
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
Distributed Energy-Efficient Cooperative Routing in Wireless Networks
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...
Ahmed S. Ibrahim, Zhu Han, K. J. Ray Liu
ICCV
2007
IEEE
14 years 1 months ago
Efficient Generic Calibration Method for General Cameras with Single Centre of Projection
Generic camera calibration is a non-parametric calibration technique that is applicable to any type of vision sensor. However, the standard generic calibration method was develope...
Aubrey K. Dunne, John Mallon, Paul F. Whelan
DELTA
2004
IEEE
14 years 1 months ago
Scan Test of IP Cores in an ATE Environment
Manufacturing test of chips made of multiple IP cores requires different techniques if ATE is used. As scan chains are commonly used as access paths to the DUT, ATE architectures ...
Luca Schiano, Yong-Bin Kim, Fabrizio Lombardi
DILS
2004
Springer
14 years 1 months ago
Efficient Techniques to Explore and Rank Paths in Life Science Data Sources
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
Zoé Lacroix, Louiqa Raschid, Maria-Esther V...
FOCS
2004
IEEE
14 years 1 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot