99 search results - page 14 / 20 » Scott's problem for Proper Scott sets |
APPROX
2007
Springer
14 years 18 days ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
CVPR
2010
IEEE
13 years 12 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
TWC
2008
13 years 8 months ago
2008
We consider resource allocation for elastic wireless applications that measure utility by target connection average throughput and achieved throughput. We construct a framework for...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
In active learning, where a learning algorithm has to purchase the labels of its training examples, it is often assumed that there is only one labeler available to label examples, ...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...