Sciweavers

2314 search results - page 408 / 463
» Minimal Partitions of a Graph
Sort
View
143
Voted
ICCAD
1999
IEEE
81views Hardware» more  ICCAD 1999»
15 years 7 months ago
Modeling design constraints and biasing in simulation using BDDs
Constraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulatio...
Jun Yuan, Kurt Shultz, Carl Pixley, Hillel Miller,...
109
Voted
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 7 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
133
Voted
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
15 years 7 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
DMSN
2007
ACM
15 years 7 months ago
SenseSwarm: a perimeter-based data acquisition framework for mobile sensor networks
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
Demetrios Zeinalipour-Yazti, Panayiotis Andreou, P...
141
Voted
FASE
2006
Springer
15 years 7 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Therese Berg, Bengt Jonsson, Harald Raffelt