Sciweavers

3573 search results - page 615 / 715
» Reasoning about Codata
Sort
View
225
Voted
POPL
2003
ACM
16 years 1 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
RECOMB
2005
Springer
16 years 1 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
101
Voted
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 1 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
VLDB
2007
ACM
119views Database» more  VLDB 2007»
16 years 28 days ago
Dynamic Workload Management for Very Large Data Warehouses: Juggling Feathers and Bowling Balls
Workload management for business intelligence (BI) queries poses different challenges than those addressed in the online transaction processing (OLTP) context. The fundamental pro...
Stefan Krompass, Umeshwar Dayal, Harumi A. Kuno, A...
VLDB
2007
ACM
104views Database» more  VLDB 2007»
16 years 28 days ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma