Sciweavers

793 search results - page 66 / 159
» Efficient computation of the characteristic polynomial
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
SIAMNUM
2010
134views more  SIAMNUM 2010»
13 years 2 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
14 years 7 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
SCA
2007
13 years 10 months ago
Legendre fluids: a unified framework for analytic reduced space modeling and rendering of participating media
In this paper, we present a unified framework for reduced space modeling and rendering of dynamic and nonhomogenous participating media, like snow, smoke, dust and fog. The key id...
Mohit Gupta, Srinivasa G. Narasimhan
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 7 months ago
A High Performance Memory Database for Web Application Caches
This paper presents the architecture and characteristics of a memory database intended to be used as a cache engine for web applications. Primary goals of this database are speed a...
Ivan Voras, Danko Basch, Mario Zagar