Sciweavers

398 search results - page 13 / 80
» A new biclustering technique based on crossing minimization
Sort
View
IRI
2006
IEEE
14 years 1 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
UIST
2010
ACM
13 years 5 months ago
Pen + touch = new tools
We describe techniques for direct pen+touch input. We observe people's manual behaviors with physical paper and notebooks. These serve as the foundation for a prototype Micro...
Ken Hinckley, Koji Yatani, Michel Pahud, Nicole Co...
CHI
2008
ACM
14 years 7 months ago
Optimal parameters for efficient crossing-based dialog boxes
We present an empirical analysis of crossing-based dialog boxes. First, we study the spatial constraints required for efficient crossing-based interactions in the case of a simple...
Morgan Dixon, François Guimbretière,...
ICPPW
2000
IEEE
13 years 11 months ago
Active Streaming in Transport Delay Minimization
In this paper we present a technique for reducing response delay for web systems, which is based on a proactive cache scheme. It combines predictive pre-fetching and streaming to ...
Javed I. Khan
BMCBI
2011
13 years 2 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