Sciweavers

3663 search results - page 372 / 733
» Problems in the ontology of computer programs
Sort
View
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 10 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
ICMCS
2000
IEEE
122views Multimedia» more  ICMCS 2000»
15 years 10 months ago
Optimal Streaming of Layer-Encoded Multimedia Presentations
In the context of communication networks with no QoS guarantees, we describe the problem of streaming layer encoded multimedia presentation data as a two-phase decision problem. W...
David A. Turner, Keith W. Ross
DEDUCTIVE
1994
119views Database» more  DEDUCTIVE 1994»
15 years 8 months ago
Determining Correct View Update Translations via Query Containment
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update...
Anthony Tomasic
ICIP
2009
IEEE
15 years 4 months ago
Lamp: Linear approach for matching points
The 3D object recognition from a single or multiple 2D images is a very important problem in the computer vision field with a wide range of real applications. Considering the affi...
Manuel Marques, João Costeira
CP
2008
Springer
15 years 8 months ago
Search Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
Helmut Simonis, Barry O'Sullivan