Sciweavers

14518 search results - page 2490 / 2904
» Two Problems for Sophistication
Sort
View
180
Voted
ICNP
2002
IEEE
15 years 11 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
159
Voted
ICPPW
2002
IEEE
15 years 11 months ago
A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung
LICS
2002
IEEE
15 years 11 months ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar
162
Voted
RIDE
2002
IEEE
15 years 11 months ago
A Scheme for Integrating e-Services in Establishing Virtual Enterprises
An important aspect of Business to Business ECommerce is the agile Virtual Enterprise (VE). VEs are established when existing enterprises dynamically form temporary alliances, joi...
Alan Berfield, Panos K. Chrysanthis, Ioannis Tsama...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
« Prev « First page 2490 / 2904 Last » Next »