99 search results - page 8 / 20 » Improved bounds and new techniques for Davenport-Schinzel se... |
SPAA
1994
ACM
14 years 15 days ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
CLADE
2008
IEEE
14 years 2 months ago
2008
IEEE
With the exponential growth of complete genome sequences, the analysis of these sequences is becoming a powerful approach to build genome-scale metabolic models. These models can ...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
JSAC
2006
13 years 8 months ago
2006
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...