Sciweavers

661 search results - page 105 / 133
» Combining Information using Hard Constraints
Sort
View
117
Voted
CIKM
2006
Springer
15 years 2 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
JNSM
2008
130views more  JNSM 2008»
15 years 12 days ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
124
Voted
BMCBI
2011
14 years 7 months ago
SNPPicker: High quality tag SNP selection across multiple populations
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
Hugues Sicotte, David N. Rider, Gregory A. Poland,...
80
Voted
ASSETS
2006
ACM
15 years 6 months ago
The vocal joystick: : evaluation of voice-based cursor control techniques
Mouse control has become a crucial aspect of many modern day computer interactions. This poses a challenge for individuals with motor impairments or those whose use of hands are r...
Susumu Harada, James A. Landay, Jonathan Malkin, X...
101
Voted
SACMAT
2009
ACM
15 years 7 months ago
xDomain: cross-border proofs of access
A number of research systems have demonstrated the benefits of accompanying each request with a machine-checkable proof that the request complies with access-control policy — a...
Lujo Bauer, Limin Jia, Michael K. Reiter, David Sw...