Sciweavers

594 search results - page 80 / 119
» Using Approximation to Relate Computational Classes over the...
Sort
View
ARITH
2003
IEEE
14 years 2 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
FOCS
2007
IEEE
14 years 3 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
AROBOTS
2010
101views more  AROBOTS 2010»
13 years 9 months ago
A quantitative assessment of structural errors in grid maps
Various common error sources affect the quality of a map, e.g., salt and pepper noise and other forms of noise that are more or less uniformly distributed over the map. But there ...
Andreas Birk
UAI
2001
13 years 10 months ago
Exact Inference in Networks with Discrete Children of Continuous Parents
Many real life domains contain a mixture of discrete and continuous variables and can be modeled as hybrid Bayesian Networks (BNs). An important subclass of hybrid BNs are conditi...
Uri Lerner, Eran Segal, Daphne Koller