Sciweavers

109 search results - page 19 / 22
» General Symmetry Breaking Constraints
Sort
View
101
Voted
EMNLP
2011
13 years 11 months ago
Entire Relaxation Path for Maximum Entropy Problems
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
Moshe Dubiner, Yoram Singer
LICS
2010
IEEE
14 years 10 months ago
Polarity and the Logic of Delimited Continuations
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...
Noam Zeilberger
SPAA
2009
ACM
15 years 6 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
108
Voted
PODC
2006
ACM
15 years 5 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
ICRA
2005
IEEE
146views Robotics» more  ICRA 2005»
15 years 5 months ago
Vision SLAM in the Measurement Subspace
— In this paper we describe an approach to feature representation for simultaneous localization and mapping, SLAM. It is a general representation for features that addresses symm...
John Folkesson, Patric Jensfelt, Henrik I. Christe...