Sciweavers

2969 search results - page 262 / 594
» A space efficient algorithm for group structure computation
Sort
View
CCECE
2006
IEEE
15 years 10 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 5 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
CVPR
2008
IEEE
16 years 6 months ago
Context-aware clustering
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...
Junsong Yuan, Ying Wu
DOLAP
2004
ACM
15 years 9 months ago
PrefixCube: prefix-sharing condensed data cube
BST Condensed Cube is a fully computed cube that condenses those tuples, which are aggregated from the same single base relation tuple, into one physical tuple. Although it has be...
Jianlin Feng, Qiong Fang, Hulin Ding
TCIAIG
2010
14 years 11 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang