Sciweavers

2826 search results - page 128 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
CHI
2003
ACM
14 years 9 months ago
Efficient user interest estimation in fisheye views
We present a new technique for efficiently computing Degree-of-Interest distributions to inform the visualization of graph-structured data. The technique is independent of the int...
Jeffrey Heer, Stuart K. Card
PAMI
2010
180views more  PAMI 2010»
13 years 4 months ago
Point Set Registration via Particle Filtering and Stochastic Dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 6 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
ICML
2003
IEEE
14 years 10 months ago
Unsupervised Learning with Permuted Data
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
Sergey Kirshner, Sridevi Parise, Padhraic Smyth
PVLDB
2010
200views more  PVLDB 2010»
13 years 7 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin