Sciweavers

372 search results - page 61 / 75
» A Study of The Fragile Base Class Problem
Sort
View
80
Voted
TIT
2008
103views more  TIT 2008»
14 years 11 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
TSP
2008
117views more  TSP 2008»
14 years 11 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
JSAC
2007
81views more  JSAC 2007»
14 years 11 months ago
Packet Prioritization in Multihop Latency Aware Scheduling for Delay Constrained Communication
— This paper addresses the problem of optimizing the packet transmission schedule in a multihop wireless network with end-to-end delay constraints. The emphasis is to determine t...
Ben Liang, Min Dong
AAAI
2011
13 years 11 months ago
End-User Feature Labeling via Locally Weighted Logistic Regression
Applications that adapt to a particular end user often make inaccurate predictions during the early stages when training data is limited. Although an end user can improve the lear...
Weng-Keen Wong, Ian Oberst, Shubhomoy Das, Travis ...
72
Voted
CHI
2010
ACM
15 years 6 months ago
Curator: a game with a purpose for collection recommendation
Collection recommender systems suggest groups of items that work well as a whole. The interaction effects between items is an important consideration, but the vast space of possib...
Greg Walsh, Jennifer Golbeck