Sciweavers

2200 search results - page 313 / 440
» Bloch's Constant is Computable
Sort
View
MFCS
2007
Springer
16 years 13 days ago
On Approximation of Bookmark Assignments
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hir...
TAMC
2007
Springer
16 years 12 days ago
Finding a Duplicate and a Missing Item in a Stream
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
Jun Tarui
TAMC
2007
Springer
16 years 12 days ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
16 years 12 days ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
ACSAC
2006
IEEE
16 years 11 days ago
PAST: Probabilistic Authentication of Sensor Timestamps
Sensor networks are deployed to monitor the physical environment in public and vulnerable locations. It is not economically viable to house sensors in tamper-resilient enclosures ...
Ashish Gehani, Surendar Chandra