Sciweavers

2229 search results - page 444 / 446
» Comparative analysis of biclustering algorithms
Sort
View
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 3 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
CVPR
2011
IEEE
13 years 3 months ago
Fast Unsupervised Ego-Action Learning for First-person Sports Videos
Portable high-quality sports cameras (e.g. head or helmet mounted) built for recording dynamic first-person video footage are becoming a common item among many sports enthusiasts...
Kris Kitani, Yoichi Sato, Takahiro Okabe, Akihiro ...
ECCC
2011
207views ECommerce» more  ECCC 2011»
13 years 22 days ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
IANDC
2011
127views more  IANDC 2011»
13 years 22 days ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
PROMISE
2010
13 years 15 days ago
Exploiting count spectra for Bayesian fault localization
Background: Automated diagnosis of software defects can drastically increase debugging efficiency, improving reliability and time-to-market. Current, low-cost, automatic fault dia...
Rui Abreu, Alberto González-Sanchez, Arjan ...