Sciweavers

288 search results - page 47 / 58
» A Conservation Law for Generalization Performance
Sort
View
SENSYS
2004
ACM
14 years 29 days ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
BMCBI
2008
96views more  BMCBI 2008»
13 years 7 months ago
The value of position-specific scoring matrices for assessment of protein allegenicity
Background: Bioinformatics tools are commonly used for assessing potential protein allergenicity. While these methods have achieved good accuracies for highly conserved sequences,...
Shen Jean Lim, Joo Chuan Tong, Fook Tim Chew, Mart...
BMCBI
2005
162views more  BMCBI 2005»
13 years 7 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
EICS
2009
ACM
14 years 2 months ago
The tradeoff between spatial jitter and latency in pointing tasks
Interactive computing systems frequently use pointing as an input modality, while also supporting other forms of input such as alphanumeric, voice, gesture, and force. We focus on...
Andriy Pavlovych, Wolfgang Stürzlinger