275 search results - page 33 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
163
click to vote
WSNA
2003
ACM
15 years 9 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
155
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
127
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
121
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
137
click to vote
CSDA
2006
15 years 4 months ago
2006
Generalized additive models (GAM) for modelling nonlinear effects of continuous covariates are now well established tools for the applied statistician. In this paper we develop Ba...