Sciweavers

1089 search results - page 99 / 218
» Bounds on generalized Frobenius numbers
Sort
View
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
13 years 11 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
MOR
2010
121views more  MOR 2010»
13 years 7 months ago
Customer Abandonment in Many-Server Queues
We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue ex...
J. G. Dai, Shuangchi He
ICIP
2009
IEEE
14 years 10 months ago
Higher-order Riesz Transforms And Steerable Wavelet Frames
We introduce an Nth-order extension of the Riesz transform in d dimensions. We prove that this generalized transform has the following remarkable properties: shift-invariance, sca...
CVPR
2010
IEEE
14 years 5 months ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
UC
2009
Springer
14 years 3 months ago
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
Karl Svozil