Sciweavers

288 search results - page 14 / 58
» Notes on computing minimal approximant bases
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 7 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
VLSISP
2010
205views more  VLSISP 2010»
13 years 8 months ago
Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
JAIR
1998
81views more  JAIR 1998»
13 years 9 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
GIS
2006
ACM
14 years 11 months ago
Object localization based on directional information case of 2D vector data
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
Stelian Coros, JingBo Ni, Pascal Matsakis
APNOMS
2006
Springer
14 years 1 months ago
Improved Handoff Performance Based on Pre-binding Update in HMIPv6
Abstract. In this paper, an efficient neighbor AR (Access Router) discovery scheme and handoff procedure using neighbor information are proposed. It allows each AR and Mobility Anc...
Jongpil Jeong, Min Young Chung, Hyunseung Choo