5606 search results - page 258 / 1122 » Randomization Techniques for Graphs. |
167
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
188
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
149
click to vote
FDL
2006
IEEE
16 years 16 days ago
2006
IEEE
Abstract. The paper proposes a simulation-based method for validating analog and mixed-signal circuits, using the hybrid systems methodology. This method builds upon RRT (Rapidly-e...
174
click to vote
DAWAK
2005
Springer
16 years 20 hour ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
169
click to vote
CAEPIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...