Results 1  10
of
8,548
Modular elliptic curves and Fermat’s Last Theorem
 ANNALS OF MATH
, 1995
"... When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c n ..."
Abstract

Cited by 617 (2 self)
 Add to MetaCart
When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c
Tor: The secondgeneration onion router,”
 in 13th USENIX Security Symposium. Usenix,
, 2004
"... Abstract We present Tor, a circuitbased lowlatency anonymous communication service. This secondgeneration Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract

Cited by 1229 (33 self)
 Add to MetaCart
, and efficiency. We briefly describe our experiences with an international network of more than 30 nodes. We close with a list of open problems in anonymous communication. Overview Onion Routing is a distributed overlay network designed to anonymize TCPbased applications like web browsing, secure shell
Gaussian interference channel capacity to within one bit
 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing
"... Abstract—The capacity of the twouser Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing o ..."
Abstract

Cited by 452 (28 self)
 Add to MetaCart
Abstract—The capacity of the twouser Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
observations with actual quotes are used, since it has been shown by Sarig and Warga (1989) that matrix prices are problematic. 10 To determine the credit spread, CS i t , for bond i at month t, we use the Benchmark Treasury rates from Datastream for maturities of 3, 5, 7, 10, and 30 years, and then use a
How important is methodology for the estimates of the determinants of happiness
 Economic Journal
, 2004
"... Psychologists and sociologists usually interpret happiness scores as cardinal and comparable across respondents, and thus run OLS regressions on happiness and changes in happiness. Economists usually assume only ordinality and have mainly used ordered latent response models, thereby not taking satis ..."
Abstract

Cited by 406 (14 self)
 Add to MetaCart
on happiness,1 the last couple of years witnessed a spate of empirical studies on this subject.2,3 Next to the economic literature, there are more than 3000 studies done in the last 30 years by psychologists and sociologists (Veenhoven, 1994; Veenhoven, 1997). This means that there is now a large com
CollusionSecure Fingerprinting for Digital Data
 IEEE Transactions on Information Theory
, 1996
"... This paper discusses methods for assigning codewords for the purpose of fingerprinting digital data (e.g., software, documents, and images). Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy and trac ..."
Abstract

Cited by 353 (1 self)
 Add to MetaCart
and trace it back to the user. This threat of detection will hopefully deter users from releasing unauthorized copies. A problem arises when users collude: For digital data, two different fingerprinted objects can be compared and the differences between them detected. Hence, a set of users can collude
Misery loves companies: Rethinking social initiatives by business
 Administrative Science Quarterly
, 2003
"... Companies are increasingly asked to provide innovative solutions to deepseated problems of human misery, even as economic theory instructs managers to focus on maximizing their shareholders ' wealth. In this paper, we assess how organization theory and empirical research have thus far responde ..."
Abstract

Cited by 350 (3 self)
 Add to MetaCart
is conceived, we examine the consequences for organizational research and theory by appraising both the 30year quest for an empirical relationship between a corporation's social initiatives and its financial performance, as well as
Principles and methods of Testing Finite State Machines  a survey
 PROCEEDINGS OF IEEE
, 1996
"... With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This moti ..."
Abstract

Cited by 345 (16 self)
 Add to MetaCart
were motivated mainly by automata theory and sequential circuit testing. The area seemed to have mostly died down until a few years ago when the testing problem was resurrected and is now being studied anew due to its applications to conformance testing of communication protocols. While some old
Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time
 234 I. Chabini. Minimum expected travel times in stochastic timedependent networks revisited. Internal Report. MIT
, 1999
"... A solution is provided for what appears to be a 30yearold problem dealing with the discovery of the most efficient algorithms possible to compute alltoone shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models that a ..."
Abstract

Cited by 78 (2 self)
 Add to MetaCart
A solution is provided for what appears to be a 30yearold problem dealing with the discovery of the most efficient algorithms possible to compute alltoone shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract

Cited by 296 (42 self)
 Add to MetaCart
, and for this model, the capacity of even a network with a single relay node is open for 30 years. In this paper, we present a deterministic approach to this problem by focusing on the signal interaction rather than the noise. To this end, we propose a deterministic channel model which is analytically simpler than
Results 1  10
of
8,548