Sciweavers

1813 search results - page 120 / 363
» Calculi of Approximation Spaces
Sort
View
TKDE
2012
270views Formal Methods» more  TKDE 2012»
13 years 8 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
ICPR
2006
IEEE
16 years 7 months ago
Weakly Supervised Learning on Pre-image Problem in Kernel Methods
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
Weishi Zheng, Jian-Huang Lai, Pong Chi Yuen
CPHYSICS
2007
100views more  CPHYSICS 2007»
15 years 6 months ago
Dielectric anisotropy in the GW space-time method
Excited-state calculations, notably for quasiparticle band structures, are nowadays routinely performed within the GW approximation for the electronic self-energy. Nevertheless, c...
Christoph Freysoldt, Philipp Eggert, Patrick Rinke...
ICALP
2004
Springer
15 years 11 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu