Sciweavers

1222 search results - page 83 / 245
» Some Results on Directable Automata
Sort
View
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
15 years 10 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
ICDCSW
2008
IEEE
15 years 4 months ago
Mobility Control for Complete Coverage in Wireless Sensor Networks
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
ASIAMS
2007
IEEE
15 years 4 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
ICASSP
2007
IEEE
15 years 4 months ago
Boosted Binary Audio Fingerprint Based on Spectral Subband Moments
An audio fingerprinting system identifies an audio based on a unique feature vector called the audio fingerprint. The performance of an audio fingerprinting system is directly...
Sungwoong Kim, Chang D. Yoo
DAGM
2007
Springer
15 years 4 months ago
Recursive Estimation with Implicit Constraints
Recursive estimation or Kalman filtering usually relies on explicit model functions, that directly and explicitly describe the effect of the parameters on the observations. Howeve...
Richard Steffen, Christian Beder