Results 1  10
of
3,373
The basic variety (or: Couldn't natural languages be much simpler
 Second Language Research
, 1997
"... In this article, we discuss the implications of the fact that adult second language learners (outside the classroom) universally develop a wellstructured, efficient and simple form of language – the Basic Variety (BV). Three questions are asked as to (1) the structural properties of the BV, (2) the ..."
Abstract

Cited by 57 (2 self)
 Add to MetaCart
In this article, we discuss the implications of the fact that adult second language learners (outside the classroom) universally develop a wellstructured, efficient and simple form of language – the Basic Variety (BV). Three questions are asked as to (1) the structural properties of the BV, (2) the status of these properties and (3) why some structural properties of ‘fully fledged ’ languages are more complex. First, we characterize the BV in four respects: its lexical repertoire, the principles according to which utterances are structured, and temporality and spatiality expressed. The organizational principles proposed are small in number, and interact. We analyse this interaction, describing how the BV is put to use in various complex verbal tasks, in order to establish both what its communicative potentialities are, and also those discourse contexts where the constraints come into conflict and where the variety breaks down. This latter phenomenon provides a partial answer to the third question,concerning the relative complexity of ‘fully fledged ’ languages – they have devices to deal
Reality for current Windows and Linux systems is much simplerWindows: IA32
"... Twolevel page table page directory – 1024 page directory entries page table – 1024 page table entries page – 4 K Virtual address space of an application: – 1024 * 1024 * 4 K = 4 GB Each PDE or PTE is 4 bytes (32 bits) – 1024 entries per level because each page directory or page table must fit in on ..."
Abstract
 Add to MetaCart
Twolevel page table page directory – 1024 page directory entries page table – 1024 page table entries page – 4 K Virtual address space of an application: – 1024 * 1024 * 4 K = 4 GB Each PDE or PTE is 4 bytes (32 bits) – 1024 entries per level because each page directory or page table must fit in one 4 K pageWindows: IA32Address Translation 10 bits to index into page directory 10 bits to index into page table – 1024 possible indices 12 bits to index into page – 4096 (4 K) possible indicesIA64 64bit addresses 8 K pages Softwareloaded TLB – OS can choose page table structure – Windows chooses a threelevel page table Top page directory
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
"... This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new faster and much simpler algorithms for these problems. ..."
Abstract

Cited by 325 (5 self)
 Add to MetaCart
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new faster and much simpler algorithms for these problems.
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3252 (70 self)
 Add to MetaCart
of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a
Large Margin Classification Using the Perceptron Algorithm
 Machine Learning
, 1998
"... We introduce and analyze a new algorithm for linear classification which combines Rosenblatt 's perceptron algorithm with Helmbold and Warmuth's leaveoneout method. Like Vapnik 's maximalmargin classifier, our algorithm takes advantage of data that are linearly separable with large ..."
Abstract

Cited by 521 (2 self)
 Add to MetaCart
with large margins. Compared to Vapnik's algorithm, however, ours is much simpler to implement, and much more efficient in terms of computation time. We also show that our algorithm can be efficiently used in very high dimensional spaces using kernel functions. We performed some experiments using our
Skip Lists: A Probabilistic Alternative to Balanced Trees
, 1990
"... Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees. ..."
Abstract

Cited by 412 (1 self)
 Add to MetaCart
Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
Short Signatures without Random Oracles
, 2004
"... We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#eHellman assumption. This assumption has similar properties to the Strong RS ..."
Abstract

Cited by 393 (11 self)
 Add to MetaCart
RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes without random oracles. However, signatures generated by our scheme are much shorter and simpler than signatures from schemes based on Strong RSA.
Sampling—50 years after Shannon
 Proceedings of the IEEE
, 2000
"... This paper presents an account of the current state of sampling, 50 years after Shannon’s formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This topic has benefited from a strong research revival during the past few years, thanks in part to the math ..."
Abstract

Cited by 339 (27 self)
 Add to MetaCart
of functions in the more general class of “shiftinvariant” functions spaces, including splines and wavelets. Practically, this allows for simpler—and possibly more realistic—interpolation models, which can be used in conjunction with a much wider class of (antialiasing) prefilters that are not necessarily
ORDERINGS FOR TERMREWRITING SYSTEMS
, 1982
"... Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree Theorem ..."
Abstract

Cited by 294 (24 self)
 Add to MetaCart
Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree
Singlepixel imaging via compressive sampling
 IEEE Signal Processing Magazine
"... Humans are visual animals, and imaging sensors that extend our reach – cameras – have improved dramatically in recent times thanks to the introduction of CCD and CMOS digital technology. Consumer digital cameras in the megapixel range are now ubiquitous thanks to the happy coincidence that the semi ..."
Abstract

Cited by 296 (19 self)
 Add to MetaCart
, a $500 digital camera for the visible becomes a $50,000 camera for the infrared. In this paper, we present a new approach to building simpler, smaller, and cheaper digital cameras that can operate efficiently across a much broader spectral range than conventional siliconbased cameras. Our approach
Results 1  10
of
3,373