13306 search results - page 2421 / 2662 » Theoretical Computer Science |
206
click to vote
ICDCS
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
221
click to vote
UAI
2008
15 years 8 months ago
2008
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...
201
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
185
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
179
click to vote
MM
2010
ACM
15 years 7 months ago
2010
ACM
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...