Sciweavers

3134 search results - page 80 / 627
» Computing full disjunctions
Sort
View
CVPR
2012
IEEE
12 years 1 months ago
Learning to localize detected objects
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
Qieyun Dai, Derek Hoiem
ISDA
2006
IEEE
14 years 5 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
14 years 4 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
ACMSE
2008
ACM
14 years 1 months ago
Optimization of the multiple retailer supply chain management problem
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
Caio Soares, Gerry V. Dozier, Emmett Lodree, Jared...
ICCV
2003
IEEE
15 years 1 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi