1208 search results - page 145 / 242 » Uniform eventown problems |
CORR
2006
Springer
14 years 10 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
IJSWIS
2008
14 years 10 months ago
2008
One of the main strengths of the web is that it allows any party of its global community to share information with any other party. This goal has been achieved by making use of a u...
IEICET
2006
14 years 10 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
104
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
SIAMCOMP
2008
14 years 9 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...