Sciweavers

2254 search results - page 330 / 451
» Computing the minimal covering set
Sort
View
ICDCS
2006
IEEE
16 years 4 days ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
166
Voted
GD
2006
Springer
15 years 9 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
188
Voted
ICCV
2007
IEEE
15 years 7 months ago
Ten-fold Improvement in Visual Odometry Using Landmark Matching
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
Zhiwei Zhu, Taragay Oskiper, Supun Samarasekera, R...
CPHYSICS
2008
123views more  CPHYSICS 2008»
15 years 6 months ago
wannier90: A tool for obtaining maximally-localised Wannier functions
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
Arash A. Mostofi, Jonathan R. Yates, Young-Su Lee,...
ENTCS
2006
172views more  ENTCS 2006»
15 years 6 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas