Sciweavers

1986 search results - page 245 / 398
» Path Separability of Graphs
Sort
View
125
Voted
AHSWN
2008
92views more  AHSWN 2008»
15 years 3 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
247
Voted
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 7 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
106
Voted
ICPR
2008
IEEE
16 years 4 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
123
Voted
ICPR
2010
IEEE
15 years 10 months ago
Motion-Sketch Based Video Retrieval Using a Trellis Levenshtein Distance
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
Rui Hu, John Philip Collomosse
139
Voted
ISBRA
2009
Springer
15 years 10 months ago
Querying Protein-Protein Interaction Networks
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
Guillaume Blin, Florian Sikora, Stéphane Vi...