Sciweavers

215 search results - page 39 / 43
» On the number of factorizations of a full cycle
Sort
View
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
14 years 2 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
ACMICEC
2006
ACM
191views ECommerce» more  ACMICEC 2006»
14 years 1 months ago
An ontology of trust: formal semantics and transitivity
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
Jingwei Huang, Mark S. Fox
ACMMSP
2006
ACM
260views Hardware» more  ACMMSP 2006»
14 years 1 months ago
Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms
A blossoming paradigm for block-recursive matrix algorithms is presented that, at once, attains excellent performance measured by • time, • TLB misses, • L1 misses, • L2 m...
Michael D. Adams, David S. Wise
VISUALIZATION
2005
IEEE
14 years 1 months ago
Fast and Reproducible Fiber Bundle Selection in DTI Visualization
Diffusion Tensor Imaging (DTI) is an MRI-based technique for quantifying water diffusion in living tissue. In the white matter of the brain, water diffuses more rapidly along the ...
Jorik Blaas, Charl P. Botha, Bart Peters, Frans Vo...
PODC
2005
ACM
14 years 29 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer