Sciweavers

JAR
2006
236views more  JAR 2006»
13 years 9 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
JNW
2008
124views more  JNW 2008»
13 years 9 months ago
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
Shahab Kamali, Jaroslav Opatrny
JAIR
2006
74views more  JAIR 2006»
13 years 9 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
JACM
2006
134views more  JACM 2006»
13 years 9 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
JMLR
2008
94views more  JMLR 2008»
13 years 9 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
IVC
2006
97views more  IVC 2006»
13 years 9 months ago
Dominant colour extraction in DCT domain
As most of MPEG and JPEG compression standards are DCT-based, we propose a simple, low-cost and fast algorithm to extract dominant colour features directly in DCT domain without i...
Jianmin Jiang, Ying Weng, Pengjie Li
IVC
2006
227views more  IVC 2006»
13 years 9 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu
CPC
2007
97views more  CPC 2007»
13 years 9 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
JETAI
2008
93views more  JETAI 2008»
13 years 9 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
CORR
2007
Springer
118views Education» more  CORR 2007»
13 years 9 months ago
Discriminated Belief Propagation
— Decisions on sources with memory transmitted over independent channels can be taken by employing trellis calculations. In this paper, it is shown that for a certain class of fu...
Uli Sorger