2168 search results - page 219 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
145
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
138
click to vote
ANCS
2007
ACM
15 years 8 months ago
2007
ACM
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
130
click to vote
ICS
2003
Tsinghua U.
15 years 9 months ago
2003
Tsinghua U.
—The ever-increasing computational power of contemporary microprocessors reduces the execution time spent on arithmetic computations (i.e., the computations not involving slow me...
138
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...
137
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...