1382 search results - page 233 / 277 » Formal Analysis of Online Algorithms |
191
Voted
BMCBI
2010
15 years 6 months ago
2010
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
200
Voted
PODC
2009
ACM
16 years 6 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
192
Voted
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
171
Voted
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
182
Voted
PVLDB
2010
15 years 27 days ago
2010
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...