Sciweavers

1312 search results - page 135 / 263
» Formally Optimal Boxing
Sort
View
TCS
2010
13 years 8 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
ICDM
2010
IEEE
142views Data Mining» more  ICDM 2010»
13 years 7 months ago
Anonymizing Temporal Data
-- Temporal data are time-critical in that the snapshot at each timestamp must be made available to researchers in a timely fashion. However, due to the limited data, each snapshot...
Ke Wang, Yabo Xu, Raymond Chi-Wing Wong, Ada Wai-C...
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 1 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 9 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
CC
2010
Springer
117views System Software» more  CC 2010»
14 years 4 months ago
Punctual Coalescing
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
Fernando Magno Quintão Pereira, Jens Palsbe...