Sciweavers

1188 search results - page 198 / 238
» Extended Graph Unification
Sort
View
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 2 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
CSCLP
2004
Springer
14 years 2 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
14 years 1 months ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
IV
2003
IEEE
118views Visualization» more  IV 2003»
14 years 1 months ago
Tools for Visual Comparison of Spatial Development Scenarios
In the paper, we suggest a set of visualization-based exploratory tools to support analysis and comparison of different spatial development scenarios, such as results of simulatio...
Natalia V. Andrienko, Gennady L. Andrienko, Peter ...
COLT
2003
Springer
14 years 1 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan