Sciweavers

2721 search results - page 279 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
BMCBI
2007
171views more  BMCBI 2007»
15 years 6 months ago
Classification of microarray data using gene networks
Background: Microarrays have become extremely useful for analysing genetic phenomena, but establishing a relation between microarray analysis results (typically a list of genes) a...
Franck Rapaport, Andrei Zinovyev, Marie Dutreix, E...
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
16 years 7 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
15 years 8 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ICIP
2003
IEEE
16 years 8 months ago
A method for reassembling fragments in image reconstruction
The reassembly of fragments to reconstruct images and objects is a problem often encountered in several applications, ranging from archeology to medicine. In this paper we present...
Francesco Amigoni, Stefano Gazzani, Simone Podico