5169 search results - page 436 / 1034 » Locality approximation using time |
193
click to vote
STOC
2005
ACM
16 years 8 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
207
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present an analytical model for the approximate calculation of the throughput and end-toend delay performance in single hop and multihop IEEE 802.11 networks unde...
223
click to vote
SPAA
2004
ACM
16 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
236
click to vote
FUZZIEEE
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Feature Selection (FS) is a technique for dimensionality reduction. Its aims are to select a subset of the original features of a dataset which are rich in the most use...
206
click to vote
PVLDB
2010
15 years 6 months ago
2010
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...