3244 search results - page 246 / 649 » On convex complexity measures |
269
click to vote
PAMI
2012
13 years 9 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
192
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
185
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
164
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
200
click to vote
EGPGV
2004
Springer
16 years 18 min ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...