Sciweavers

1322 search results - page 187 / 265
» Parameterized counting problems
Sort
View
117
Voted
HASE
1998
IEEE
15 years 8 months ago
Estimating the Number of Residual Defects
Residual defects is one of the most important factors that allow one to decide if a piece of software is ready to be released. In theory, one can find all the defects and count th...
Yashwant K. Malaiya, Jason Denton
123
Voted
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 7 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
115
Voted
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
15 years 7 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
145
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
131
Voted
CP
1995
Springer
15 years 7 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer