Sciweavers

127 search results - page 13 / 26
» Mode Directed Path Finding
Sort
View
DBPL
1993
Springer
95views Database» more  DBPL 1993»
14 years 1 months ago
A Moose and a Fox Can Aid Scientists with Data Management Problems
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments, an object-oriented data model at the core of a scient...
Janet L. Wiener, Yannis E. Ioannidis
HIPC
2007
Springer
14 years 26 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
DCOSS
2008
Springer
13 years 10 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
DAM
2008
140views more  DAM 2008»
13 years 8 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
ICPR
2008
IEEE
14 years 10 months ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta