Sciweavers

27692 search results - page 214 / 5539
» Where is ...
Sort
View
ISAAC
2003
Springer
95views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Finding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
DASFAA
2010
IEEE
189views Database» more  DASFAA 2010»
14 years 3 months ago
Peer-to-Peer Similarity Search Based on M-Tree Indexing
Similarity search in metric spaces has several important applications both in centralized and distributed environments. In centralized applications, such as similarity-based image ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
SWAT
2010
Springer
279views Algorithms» more  SWAT 2010»
14 years 3 months ago
Online Function Tracking with Generalized Penalties
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
Marcin Bienkowski, Stefan Schmid
DATE
2002
IEEE
86views Hardware» more  DATE 2002»
14 years 3 months ago
A Layered, Codesign Virtual Machine Approach to Modeling Computer Systems
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...
JoAnn M. Paul, Donald E. Thomas