Sciweavers

664 search results - page 31 / 133
» Some results for a class of generalized polynomials
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
14 years 11 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
ICONIP
2009
14 years 7 months ago
Quasi-Deterministic Partially Observable Markov Decision Processes
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
Camille Besse, Brahim Chaib-draa
WG
2005
Springer
15 years 3 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
CDB
1997
Springer
85views Database» more  CDB 1997»
15 years 1 months ago
On Expressing Topological Connectivity in Spatial Datalog
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
Bart Kuijpers, Marc Smits
AIPS
2008
15 years 8 hour ago
In Search of the Tractability Boundary of Planning Problems
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
Omer Giménez, Anders Jonsson