Sciweavers

363 search results - page 31 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
COOTS
1996
13 years 9 months ago
The Any Framework: A Pragmatic Approach to Flexibility
During the development of Beyond-Sniff, a distributed multi-user development platform, we were confronted with various, apparently unrelated problems: data, control, and user inte...
Kai-Uwe Mätzel, Walter R. Bischofberger
ACSAC
2009
IEEE
14 years 2 months ago
Privacy through Noise: A Design Space for Private Identification
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
Karsten Nohl, David Evans
SIROCCO
2004
13 years 9 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
CVPR
2004
IEEE
14 years 9 months ago
Approximation of Canonical Sets and Their Applications to 2D View Simplification
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
Trip Denton, Jeff Abrahamson, Ali Shokoufandeh
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
13 years 7 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang