Sciweavers

1995 search results - page 53 / 399
» What's the Problem
Sort
View
STACS
1999
Springer
15 years 7 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
142
Voted
CIKM
2009
Springer
15 years 6 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang
125
Voted
RECOMB
2010
Springer
15 years 10 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
126
Voted
AI
2010
Springer
15 years 3 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
100
Voted
CISS
2008
IEEE
15 years 10 months ago
Accelerated costas array enumeration using FPGAs
Abstract— Costas array enumeration is an NP-complete problem with a highly parallelize-able solution. This paper examines the implementation of a solution to this problem on an F...
Jim Devlin, Scott Rickard