3008 search results - page 400 / 602 » Independence in connected graphs |
161
click to vote
AAECC
2006
Springer
16 years 28 days ago
2006
Springer
Abstract. This paper compares two approaches to reliable communication over fading channels using low-density parity check (LDPC) codes. The particular model considered is the bloc...
194
click to vote
QSHINE
2005
IEEE
16 years 15 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
165
click to vote
KR
2004
Springer
16 years 9 days ago
2004
Springer
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...
174
click to vote
ICWE
2010
Springer
15 years 11 months ago
2010
Springer
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
188
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...