Sciweavers

1937 search results - page 316 / 388
» Starting B Specifications from Use Cases
Sort
View
170
Voted
STACS
1992
Springer
15 years 8 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
CCS
2008
ACM
15 years 6 months ago
Securing group key exchange against strong corruptions
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
Emmanuel Bresson, Mark Manulis
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
15 years 6 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
136
Voted
NAACL
2003
15 years 6 months ago
An Analysis of Clarification Dialogue for Question Answering
We examine clarification dialogue, a mechanism for refining user questions with follow-up questions, in the context of open domain Question Answering systems. We develop an algori...
Marco De Boni, Suresh Manandhar
135
Voted
BMCBI
2010
113views more  BMCBI 2010»
15 years 4 months ago
Unifying generative and discriminative learning principles
Background: The recognition of functional binding sites in genomic DNA remains one of the fundamental challenges of genome research. During the last decades, a plethora of differe...
Jens Keilwagen, Jan Grau, Stefan Posch, Marc Stric...