Sciweavers

325 search results - page 45 / 65
» Remarks on the Schoof-Elkies-Atkin algorithm
Sort
View
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
Wolfram Conen, Tuomas Sandholm
CVPR
2000
IEEE
14 years 12 months ago
High Dynamic Range Imaging: Spatially Varying Pixel Exposures
While real scenes produce a wide range of brightness variations, vision systems use low dynamic range image detectors that typically provide 8 bits of brightness data at each pixe...
Shree K. Nayar, Tomoo Mitsunaga
ECCV
2004
Springer
14 years 11 months ago
Reconstruction of 3-D Symmetric Curves from Perspective Images without Discrete Features
Abstract. The shapes of many natural and man-made objects have curved contours. The images of such contours usually do not have sufficient distinctive features to apply conventiona...
Wei Hong, Yi Ma, Yizhou Yu
DAC
2007
ACM
14 years 11 months ago
Program Mapping onto Network Processors by Recursive Bipartitioning and Refining
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
Jia Yu, Jingnan Yao, Jun Yang 0002, Laxmi N. Bhuya...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle