2100 search results - page 321 / 420 » Fundamentals of the problem |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We present a new technique for extracting local features from images of architectural scenes, based on detecting and representing local symmetries. These new features are motivate...
PODC
2012
ACM
11 years 11 months ago
2012
ACM
In the Byzantine agreement problem, a set of n processors, any f of whom may be arbitrarily faulty, must reach agreement on a value proposed by one of the correct processors. It i...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
IWDC
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...
TSP
2012
12 years 4 months ago
2012
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...