Sciweavers

1404 search results - page 237 / 281
» Optimization problems in multiple-interval graphs
Sort
View
IVC
2007
114views more  IVC 2007»
15 years 5 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
CSL
2009
Springer
16 years 16 days ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
MDM
2009
Springer
123views Communications» more  MDM 2009»
16 years 16 days ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
IPPS
2008
IEEE
16 years 11 days ago
Automatic middleware deployment planning on heterogeneous platforms
Abstract— The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalabili...
Pushpinder-Kaur Chouhan, Eddy Caron, Fréd&e...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
16 years 4 days ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...