Sciweavers

1068 search results - page 51 / 214
» On Space Bounded Server Algorithms
Sort
View
SOFSEM
2010
Springer
14 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
13 years 11 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
SIAMCO
2000
110views more  SIAMCO 2000»
13 years 7 months ago
On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
We study the asymptotic behavior at infinity of solutions of a second order evolution equation with linear damping and convex potential. The differential system is defined in a rea...
Felipe Alvarez
AINA
2006
IEEE
14 years 1 months ago
SENS: A Scalable and Expressive Naming System using CAN Routing Algorithm
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
Hoaison Nguyen, Toshio Oka, Hiroyuki Morikawa, Tom...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 9 months ago
A linear lower bound on index size for text retrieval
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
Erik D. Demaine, Alejandro López-Ortiz