Sciweavers

4235 search results - page 43 / 847
» Processes in Space
Sort
View
EMNLP
2011
12 years 8 months ago
Approximate Scalable Bounded Space Sketch for Large Data NLP
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Amit Goyal, Hal Daumé III
ICIP
2008
IEEE
14 years 3 months ago
Effects of curvature on the analysis of landmark shape manifolds
Shape spaces can be endowed with the structure of Riemannian manifolds; this allows one to compute, for example, Euler-Lagrange equations and geodesic distance for such spaces. Un...
Mario Micheli
TKDE
2002
127views more  TKDE 2002»
13 years 8 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
IS
2007
13 years 8 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
Exact aggregate solutions for M/G/1-type Markov processes
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
Alma Riska, Evgenia Smirni