Sciweavers

11722 search results - page 2272 / 2345
» How Developers Develop Features
Sort
View
RTA
2010
Springer
15 years 3 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 3 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
FCCM
2007
IEEE
122views VLSI» more  FCCM 2007»
15 years 3 months ago
Reconfigurable Computing Cluster (RCC) Project: Investigating the Feasibility of FPGA-Based Petascale Computing
While medium- and large-sized computing centers have increasingly relied on clusters of commodity PC hardware to provide cost-effective capacity and capability, it is not clear th...
Ron Sass, William V. Kritikos, Andrew G. Schmidt, ...
SIGIR
2010
ACM
15 years 3 months ago
Positional relevance model for pseudo-relevance feedback
Pseudo-relevance feedback is an effective technique for improving retrieval results. Traditional feedback algorithms use a whole feedback document as a unit to extract words for ...
Yuanhua Lv, ChengXiang Zhai
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
15 years 3 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
« Prev « First page 2272 / 2345 Last » Next »