Sciweavers

5022 search results - page 496 / 1005
» Data structures and problem solving using Java
Sort
View
BMCBI
2011
14 years 12 months ago
A novel approach to the clustering of microarray data via nonparametric density estimation
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
Riccardo De Bin, Davide Risso
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
16 years 6 months ago
Effective Computation of Biased Quantiles over Data Streams
Skewis prevalentin manydata sourcessuchas IP traffic streams. To continually summarize the distribution of such data, a highbiased set of quantiles (e.g., 50th, 90th and 99th perc...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
SAT
2007
Springer
121views Hardware» more  SAT 2007»
15 years 11 months ago
Applying Logic Synthesis for Speeding Up SAT
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...
Niklas Eén, Alan Mishchenko, Niklas Sö...
DAGSTUHL
2006
15 years 6 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
LCTRTS
2007
Springer
15 years 11 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue