Sciweavers

7106 search results - page 189 / 1422
» Restricted Complexity, General Complexity
Sort
View
133
Voted
APAL
2007
131views more  APAL 2007»
15 years 3 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
127
Voted
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 3 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
136
Voted
ORL
2008
63views more  ORL 2008»
15 years 3 months ago
The inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
Dorit S. Hochbaum, Erick Moreno-Centeno
125
Voted
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
15 years 9 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
129
Voted
JGS
2000
97views more  JGS 2000»
15 years 3 months ago
Part 3 Specialized aspects of GIS and spatial analysis
GIS and spatial analysis is suited mainly for static pictures of the landscape, but many of the processes that need exploring are dynamic in nature. Dynamic processes can be comple...
Paul W. Box