Sciweavers

5653 search results - page 455 / 1131
» Distributed Conceptual Structures
Sort
View
ICDT
2005
ACM
88views Database» more  ICDT 2005»
16 years 1 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
COLT
1994
Springer
15 years 11 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby
MICCAI
2007
Springer
16 years 8 months ago
LOCUS: LOcal Cooperative Unified Segmentation of MRI Brain Scans
Abstract. We propose to carry out cooperatively both tissue and structure segmentations by distributing a set of local and cooperative models in a unified MRF framework. Tissue seg...
Benoit Scherrer, Michel Dojat, Florence Forbes, Ca...
WWW
2004
ACM
16 years 8 months ago
The powerrank web link analysis algorithm
The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this p...
Yizhou Lu, Benyu Zhang, Wensi Xi, Zheng Chen, Yi L...
IPPS
2007
IEEE
16 years 1 months ago
A Key-based Adaptive Transactional Memory Executor
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
Tongxin Bai, Xipeng Shen, Chengliang Zhang, Willia...