Sciweavers

3652 search results - page 327 / 731
» A study of query length
Sort
View
COCOON
2001
Springer
15 years 8 months ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer
ICALP
2001
Springer
15 years 8 months ago
Hidden Pattern Statistics
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
Philippe Flajolet, Yves Guivarc'h, Wojciech Szpank...
125
Voted
IPPS
2000
IEEE
15 years 8 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
110
Voted
RSP
1998
IEEE
110views Control Systems» more  RSP 1998»
15 years 8 months ago
Rapid Design of Discrete Orthonormal Wavelet Transforms
A rapid design methodology for orthonormal wavelet transform cores has been developed. This methodology is based on a generic, scaleable architecture utilising time-interleaved co...
Shahid Masud, John V. McCanny
95
Voted
CVPR
1997
IEEE
15 years 8 months ago
Completion Energies and Scale
ÐThe detection of smooth curves in images and their completion over gaps are two important problems in perceptual grouping. In this study, we examine the notion of completion ener...
Eitan Sharon, Achi Brandt, Ronen Basri