1941 search results - page 261 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
107
click to vote
KDD
2012
ACM
13 years 14 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
SLIP
2003
ACM
15 years 3 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
MICRO
2006
IEEE
15 years 4 months ago
2006
IEEE
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
101
click to vote
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...