Sciweavers

1591 search results - page 282 / 319
» Random lifts of graphs
Sort
View
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
15 years 3 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
KR
2004
Springer
15 years 3 months ago
GAI Networks for Utility Elicitation
This paper deals with preference representation and elicitation in the context of multiattribute utility theory under risk. Assuming the decision maker behaves according to the EU...
Christophe Gonzales, Patrice Perny
PAM
2004
Springer
15 years 3 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
COLT
2003
Springer
15 years 3 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
FOCS
2002
IEEE
15 years 2 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor