Sciweavers

232 search results - page 30 / 47
» On Characterizing the Data Access Complexity of Programs
Sort
View
ESWS
2010
Springer
15 years 2 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani
JILP
2000
165views more  JILP 2000»
14 years 10 months ago
BMAT - A Binary Matching Tool for Stale Profile Propagation
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...
Zheng Wang, Ken Pierce, Scott McFarling
CHI
2011
ACM
14 years 2 months ago
The aligned rank transform for nonparametric factorial analyses using only anova procedures
Nonparametric data from multi-factor experiments arise often in human-computer interaction (HCI). Examples may include error counts, Likert responses, and preference tallies. But ...
Jacob O. Wobbrock, Leah Findlater, Darren Gergle, ...
JPDC
2011
137views more  JPDC 2011»
14 years 1 months ago
Transparent runtime parallelization of the R scripting language
Scripting languages such as R and Matlab are widely used in scientific data processing. As the data volume and the complexity of analysis tasks both grow, sequential data process...
Jiangtian Li, Xiaosong Ma, Srikanth B. Yoginath, G...
RECOMB
2006
Springer
15 years 11 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...