Sciweavers

8413 search results - page 489 / 1683
» Ordering Problem Subgoals
Sort
View
ICALP
2005
Springer
16 years 10 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
16 years 6 days ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 5 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
KER
2007
90views more  KER 2007»
15 years 6 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
CVPR
2008
IEEE
16 years 8 months ago
Structure learning in random fields for heart motion abnormality detection
Coronary Heart Disease can be diagnosed by assessing the regional motion of the heart walls in ultrasound images of the left ventricle. Even for experts, ultrasound images are dif...
Glenn Fung, Kevin Murphy, Mark Schmidt, Róm...