Sciweavers

4428 search results - page 779 / 886
» The Chow Parameters Problem
Sort
View
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
15 years 10 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
CVPR
2010
IEEE
15 years 9 months ago
Semantic Context Modeling with Maximal Margin Conditional Random Fields for Automatic Image Annotation
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
Yu Xiang, Xiangdong Zhou, Zuotao Liu, Tat-seng chu...
IPPS
2005
IEEE
15 years 9 months ago
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures...
Prasanna Sugavanam, Howard Jay Siegel, Anthony A. ...
PODC
2005
ACM
15 years 9 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
168
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern