Sciweavers

2778 search results - page 51 / 556
» Limit complexities revisited
Sort
View
AUTONOMICS
2007
ACM
15 years 3 months ago
End-to-end vs. hop-by-hop transport under intermittent connectivity
This paper revisits the fundamental trade-off between endto-end and hop-by-hop transport control. The end-to-end principle has been one of the building blocks of the Internet; but...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...
EWCBR
2006
Springer
15 years 3 months ago
What Evaluation Criteria Are Right for CCBR? Considering Rank Quality
Abstract. Evaluation criteria for conversational CBR (CCBR) systems are important to guide development and tuning of new methods, and to enable practitioners to make informed decis...
Steven Bogaerts, David B. Leake
INFOCOM
2010
IEEE
14 years 10 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 12 months ago
Eigenvalue Results for Large Scale Random Vandermonde Matrices with Unit Complex Entries
Abstract--This paper centers on the limit eigenvalue distribution for random Vandermonde matrices with unit magnitude complex entries. The phases of the entries are chosen independ...
Gabriel H. Tucci, Philip A. Whiting
TIT
2010
124views Education» more  TIT 2010»
14 years 6 months ago
On the capacity of the precision-resolution system
Arguably, the most prominent constrained system in storage applications is the (d; k)-run-length limited (RLL) system, where every binary sequence obeys the constraint that every t...
Moshe Schwartz, Jehoshua Bruck