Sciweavers

1578 search results - page 54 / 316
» Algorithmic randomness of continuous functions
Sort
View
UIST
2005
ACM
14 years 4 months ago
Informal prototyping of continuous graphical interactions by demonstration
Informal prototyping tools have shown great potential in facilitating the early stage design of user interfaces. However, continuous interactions, an important constituent of high...
Yang Li, James A. Landay
DAWAK
2005
Springer
14 years 4 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
HASE
2008
IEEE
13 years 11 months ago
Randomization Based Probabilistic Approach to Detect Trojan Circuits
In this paper, we propose a randomization based technique to verify whether a manufactured chip conforms to its design or is infected by any trojan circuit. A trojan circuit can be...
Susmit Jha, Sumit Kumar Jha
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 11 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
BMCBI
2008
169views more  BMCBI 2008»
13 years 11 months ago
A comprehensive comparison of random forests and support vector machines for microarray-based cancer classification
Background: Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular sig...
Alexander R. Statnikov, Lily Wang, Constantin F. A...