Sciweavers

18572 search results - page 3209 / 3715
» High performance C
Sort
View
306
Voted
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
159
Voted
SIGIR
2011
ACM
14 years 7 months ago
Active learning to maximize accuracy vs. effort in interactive information retrieval
We consider an interactive information retrieval task in which the user is interested in finding several to many relevant documents with minimal effort. Given an initial documen...
Aibo Tian, Matthew Lease
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
14 years 7 months ago
Querying contract databases based on temporal behavior
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
Elio Damaggio, Alin Deutsch, Dayou Zhou
ICCV
2011
IEEE
14 years 5 months ago
A 3D Laplacian-Driven Parametric Deformable Model
3D parametric deformable models have been used to extract volumetric object boundaries and they generate smooth boundary surfaces as results. However, in some segmentation cases, ...
Tian Shen, Xiaolei Huang, Hongsheng Li, Edward Kim...
220
Voted
ICCV
2011
IEEE
14 years 4 months ago
Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion
The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
Gunhee Kim, Eric P. Xing, Li Fei-Fei, Takeo Kanade
« Prev « First page 3209 / 3715 Last » Next »