Sciweavers

5695 search results - page 779 / 1139
» Using Many Cameras as One
Sort
View
POPL
2005
ACM
16 years 7 months ago
Formal prototyping in early stages of protocol design
Network protocol design is usually an informal process where debugging is based on successive iterations of a prototype implementation. The feedback provided by a prototype can be...
Alwyn Goodloe, Carl A. Gunter, Mark-Oliver Stehr
RECOMB
2005
Springer
16 years 7 months ago
Consensus Folding of Unaligned RNA Sequences Revisited
As one of the earliest problems in computational biology, RNA secondary structure prediction (sometimes referred to as "RNA folding") problem has attracted attention agai...
Vineet Bafna, Haixu Tang, Shaojie Zhang
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 7 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
ICALP
2009
Springer
16 years 7 months ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang