Sciweavers

2100 search results - page 368 / 420
» Fundamentals of the problem
Sort
View
IPMI
2005
Springer
14 years 10 months ago
Extrapolation of Sparse Tensor Fields: Application to the Modeling of Brain Variability
Modeling the variability of brain structures is a fundamental problem in the neurosciences. In this paper, we start from a dataset of precisely delineated anatomical structures in ...
Pierre Fillard, Vincent Arsigny, Xavier Pennec, Pa...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 9 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 9 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 9 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 9 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng