Sciweavers

7 search results - page 1 / 2
» On the Time Splitting Spectral Method for the Complex Ginzbu...
Sort
View
SIAMSC
2008
136views more  SIAMSC 2008»
13 years 4 months ago
On the Time Splitting Spectral Method for the Complex Ginzburg-Landau Equation in the Large Time and Space Scale Limit
We are interested in the numerical approximation of the complex Ginzburg
Pierre Degond, Shi Jin, Min Tang
JCNS
2000
165views more  JCNS 2000»
13 years 4 months ago
A Population Density Approach That Facilitates Large-Scale Modeling of Neural Networks: Analysis and an Application to Orientati
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
Duane Q. Nykamp, Daniel Tranchina
CIKM
2008
Springer
13 years 6 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 3 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
CVPR
2004
IEEE
14 years 6 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell