Sciweavers

11160 search results - page 157 / 2232
» Incompleteness in a General Setting
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 1 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
INFOCOM
2006
IEEE
15 years 6 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
104
Voted
VISUALIZATION
1998
IEEE
15 years 5 months ago
A general method for preserving attribute values on simplified meshes
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
Paolo Cignoni, Claudio Montani, Roberto Scopigno, ...
115
Voted
AAAI
2010
15 years 2 months ago
Computationally Feasible Automated Mechanism Design: General Approach and Case Studies
In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechan...
Mingyu Guo, Vincent Conitzer
95
Voted
IJCV
2006
100views more  IJCV 2006»
15 years 23 days ago
A General Framework for Combining Visual Trackers - The "Black Boxes" Approach
Abstract. Over the past few years researchers have been investigating the enhancement of visual tracking performance by devising trackers that simultaneously make use of several di...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin