Results 1  10
of
834,345
A New Kind of Science
, 2002
"... “Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical amplit ..."
Abstract

Cited by 893 (0 self)
 Add to MetaCart
“Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical
Online Learning with Kernels
, 2003
"... Kernel based algorithms such as support vector machines have achieved considerable success in various problems in the batch setting where all of the training data is available in advance. Support vector machines combine the socalled kernel trick with the large margin idea. There has been little u ..."
Abstract

Cited by 2831 (123 self)
 Add to MetaCart
Kernel based algorithms such as support vector machines have achieved considerable success in various problems in the batch setting where all of the training data is available in advance. Support vector machines combine the socalled kernel trick with the large margin idea. There has been little
Jflow: Practical mostlystatic information flow control.
 In Proceedings of the 26th ACM SIGPLANSIGACT symposium on Principles of programming languages,
, 1999
"... Abstract A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work has proposed programming language extensions to allow this static checking, the resulting languages are too res ..."
Abstract

Cited by 584 (33 self)
 Add to MetaCart
control, and exceptions. This paper defines the JFlow language and presents formal rules that are used to check JFlow programs for correctness. Because most checking is static, there is little code space, data space, or runtime overhead in the JFlow implementation.
Fast Prefix Search in Little Space, with Applications
"... Abstract. It has been shown in the indexing literature that there is an essential difference between prefix/range searches on the one hand, and predecessor/rank searches on the other hand, in that the former provably allows faster query resolution. Traditionally, prefix search is solved by data stru ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
prefix. In fact, we show that our most spaceefficient data structure is asymptotically spaceoptimal. Previously, data structures such as String Btrees (and more complicated cacheoblivious string data structures) have implicitly supported weak prefix queries, but they all have query time that grows
ConstantTime Array Initialization in Little Space
"... We improve a folklore data structure for initializing an array of n elements in constant time, by reducing its space requirement from 2n lg n to n + o(n) bits. 1. ..."
Abstract
 Add to MetaCart
We improve a folklore data structure for initializing an array of n elements in constant time, by reducing its space requirement from 2n lg n to n + o(n) bits. 1.
(lat. On Dynamic Dictionaries Using Little Space)?
"... 1 Introduction The dictionary is one of the most fundamental datastructural problems in computer science. In its basic form, a dictionary allows some form of "lookup " on a set S of n objects, and in a dynamic dictionary, elements can be inserted intoand deleted from the set S. H ..."
Abstract
 Add to MetaCart
1 Introduction The dictionary is one of the most fundamental datastructural problems in computer science. In its basic form, a dictionary allows some form of "lookup " on a set S of n objects, and in a dynamic dictionary, elements can be inserted intoand deleted from the set S. However, being such a wellstudied problem, thereare many variations in the details of what exactly is required of a dictionary,
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 446 (13 self)
 Add to MetaCart
, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical twovalued setting, but the result provides a natural semantics for distributed logic programs, including
Hierarchical Modelling and Analysis for Spatial Data. Chapman and Hall/CRC,
, 2004
"... Abstract Often, there are two streams in statistical research one developed by practitioners and other by main stream statisticians. Development of geostatistics is a very good example where pioneering work under realistic assumptions came from mining engineers whereas it is only now that statisti ..."
Abstract

Cited by 442 (45 self)
 Add to MetaCart
parameter spaces. The method of ML in geoestatistics can be used complementary with the well established method among practitioners of graphical variogram modelling. The variogram plots should be used as a tool for getting hints on selecting a model and the actual unknown parameters of the model could
From frequency to meaning : Vector space models of semantics
 Journal of Artificial Intelligence Research
, 2010
"... Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics are begi ..."
Abstract

Cited by 347 (3 self)
 Add to MetaCart
Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space)
, 2005
"... We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up to constant factors, subject to insertions and deletions, and subject to supporting perfecthashing queries and/or membership queries, each operation in constant time with high probability. When supporting only ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up to constant factors, subject to insertions and deletions, and subject to supporting perfecthashing queries and/or membership queries, each operation in constant time with high probability. When supporting
Results 1  10
of
834,345