Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,957
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
"... We give an O(n √ lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n / lg lg n) that followed from Dietz’s data structure [WADS’89], and answers a question of Andersson and Petersson [SODA’95]. As Dietz’s ..."
Abstract
-
Cited by 16 (4 self)
- Add to MetaCart
. However, the technique finds numerous applications: for example, we obtain • in d dimensions, an algorithm to answer n offline orthogonal range counting queries in time O(n lg d−2+1/d n); • an improved construction time for online data structures for orthogonal range counting; • an improved update time
The Cougar Approach to In-Network Query Processing in Sensor Networks
- SIGMOD Record
, 2002
"... The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such example is a sensor network consisting of a large number of sensor nodes that combine physical sensing capabilities such as te ..."
Abstract
-
Cited by 498 (1 self)
- Add to MetaCart
such as temperature, light, or seismic sensors with networking and computation capabilities. Applications range from environmental control, warehouse inventory, and health care to military environments. Existing sensor networks assume that the sensors are preprogrammed and send data to a central frontend where
K-theory for operator algebras
- Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line-5: since p. 1-2: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The Riesz-Fischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract
-
Cited by 558 (0 self)
- Add to MetaCart
p. XII line-5: since p. 1-2: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The Riesz-Fischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b
Six views of embodied cognition
- PSYCHONOMIC BULLETIN AND REVIEW
, 2002
"... The emerging viewpoint of embodied cognition holds that cognitive processes are deeply rooted in the body’s interactions with the world. This position actually houses a number of distinct claims, some of which are more controversial than others. This paper distinguishes and evaluates the following s ..."
Abstract
-
Cited by 339 (1 self)
- Add to MetaCart
six claims: 1) cognition is situated; 2) cognition is time-pressured; 3) we off-load cognitive work onto the environment; 4) the environment is part of the cognitive system; 5) cognition is for action; 6) off-line cognition is body-based. Of these, the first three and the fifth appear to be at least
Translation-invariant de-noising
, 1995
"... De-Noising with the traditional (orthogonal, maximally-decimated) wavelet transform sometimes exhibits visual artifacts; we attribute some of these – for example, Gibbs phenomena in the neighborhood of discontinuities – to the lack of translation invariance of the wavelet basis. One method to suppre ..."
Abstract
-
Cited by 307 (7 self)
- Add to MetaCart
, and averaging the several results so obtained, produces a reconstruction subject to far weaker Gibbs phenomena than thresholding based De-Noising using the traditional orthogonal wavelet transform. Cycle-Spinning over the range of all circulant shifts can be accomplished in order nlog 2(n) time
Robust Range Estimation Using Acoustic and Multimodal Sensing
, 2001
"... Many applications of robotics and embedded sensor technology can benet from ne-grained localization. Fine-grained localization can simplify multi-robot collaboration, enable energy ecient multi-hop routing for low-power radio networks, and enable automatic calibration of distributed sensing systems. ..."
Abstract
-
Cited by 184 (17 self)
- Add to MetaCart
. In this work we focus on range estimation, a critical prerequisite for ne-grained localization. While many mechanisms for range estimation exist, any individual mode of sensing can be blocked or confused by the environment. We present and analyze an acoustic ranging system that performs well in the presence
Evaluating intrusion detection systems: The 1998 darpa off-line intrusion detection evaluation
- in Proceedings of the 2000 DARPA Information Survivability Conference and Exposition
, 2000
"... A intrusion detection evaluation test bed was developed which generated normal traffic similar to that on a government site containing 100’s of users on 1000’s of hosts. More than 300 instances of 38 different automated attacks were launched against victim UNIX hosts in seven weeks of training data ..."
Abstract
-
Cited by 165 (3 self)
- Add to MetaCart
and two weeks of test data. Six research groups participated in a blind evaluation and results were analyzed for probe, denialof-service (DoS), remote-to-local (R2L), and user to root (U2R) attacks. The best systems detected old attacks included in the training data, at moderate detection rates ranging
Balanced model reduction via the proper orthogonal decomposition
- AIAA Journal
, 2002
"... A new method for performing a balanced reduction of a high-order linear system is presented. The technique combines the proper orthogonal decomposition and concepts from balanced realization theory. The method of snapshots is used to obtain low-rank, reduced-range approximationsto the system control ..."
Abstract
-
Cited by 134 (6 self)
- Add to MetaCart
A new method for performing a balanced reduction of a high-order linear system is presented. The technique combines the proper orthogonal decomposition and concepts from balanced realization theory. The method of snapshots is used to obtain low-rank, reduced-range approximationsto the system
New Data Structures for Orthogonal Range Searching
, 2001
"... We present new general techniques for static orthogonal range searching problems intwo and higher dimensions. For the general range reporting problem in R 3, we achieve query time O(log n + k) using space O(n log1+ " n), where n denotes the number of storedpoints and k the number of point ..."
Abstract
-
Cited by 80 (2 self)
- Add to MetaCart
We present new general techniques for static orthogonal range searching problems intwo and higher dimensions. For the general range reporting problem in R 3, we achieve query time O(log n + k) using space O(n log1+ " n), where n denotes the number of storedpoints and k the number
A Foundation for Representing and Querying Moving Objects
, 2000
"... Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously which describe moving objects. Two fundamental abstractions are moving ..."
Abstract
-
Cited by 200 (39 self)
- Add to MetaCart
the projection of a moving point into the plane, or a "moving real" to represent the time-dependent distance of two moving points. It then becomes crucial to achieve (i) orthogonality in the design of the type system, i.e., type constructors can be applied uniformly, (ii) genericity and consistency
Results 1 - 10
of
2,957
