Sciweavers

687 search results - page 111 / 138
» On The Complexity of Manipulating Elections
Sort
View
SIAMREV
2011
63views more  SIAMREV 2011»
12 years 11 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 2 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha
BMCBI
2008
141views more  BMCBI 2008»
13 years 8 months ago
Ontology-guided data preparation for discovering genotype-phenotype relationships
Complexity of post-genomic data and multiplicity of mining strategies are two limits to Knowledge Discovery in Databases (KDD) in life sciences. Because they provide a semantic fr...
Adrien Coulet, Malika Smaïl-Tabbone, Pascale ...
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
ICDT
2009
ACM
128views Database» more  ICDT 2009»
14 years 8 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani