Sciweavers

706 search results - page 137 / 142
» Super Solutions in Constraint Programming
Sort
View
CASES
2004
ACM
15 years 5 months ago
Procedure placement using temporal-ordering information: dealing with code size expansion
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
Christophe Guillon, Fabrice Rastello, Thierry Bida...
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
15 years 3 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
UAI
1997
15 years 28 days ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 2 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
ECCV
2004
Springer
16 years 1 months ago
What Do Four Points in Two Calibrated Images Tell Us about the Epipoles?
Suppose that two perspective views of four world points are given, that the intrinsic parameters are known, but the camera poses and the world point positions are not. We prove tha...
David Nistér, Frederik Schaffalitzky