Sciweavers

1632 search results - page 147 / 327
» On special numberings of hypergraphs
Sort
View
DM
2007
83views more  DM 2007»
15 years 6 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge
JDA
2006
184views more  JDA 2006»
15 years 6 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
JPDC
2006
129views more  JPDC 2006»
15 years 6 months ago
LAD: Localization anomaly detection for wireless sensor networks
In wireless sensor networks (WSNs), sensors' locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number ...
Wenliang Du, Lei Fang, Peng Ning
JSAC
2006
112views more  JSAC 2006»
15 years 6 months ago
Optimal Bandwidth Allocation in a Delay Channel
In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finit...
Navid Ehsan, Mingyan Liu
ORL
2008
63views more  ORL 2008»
15 years 6 months ago
The inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
Dorit S. Hochbaum, Erick Moreno-Centeno