25041 search results - page 4880 / 5009 » Algorithms for Clustering Data |
CHI
2002
ACM
14 years 10 months ago
2002
ACM
We propose a formal experimental paradigm designed to help evaluate scrolling interaction techniques. Such a method is needed by interaction designers to quantify scrolling perfor...
POPL
2007
ACM
14 years 10 months ago
2007
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
POPL
2007
ACM
14 years 10 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
RECOMB
2004
Springer
14 years 10 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...