Sciweavers

281 search results - page 38 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
15 years 4 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 4 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
DASFAA
2007
IEEE
199views Database» more  DASFAA 2007»
15 years 4 months ago
Detection and Visualization of Subspace Cluster Hierarchies
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
GD
2003
Springer
15 years 2 months ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
ICCV
2005
IEEE
15 years 11 months ago
Deformation Invariant Image Matching
We propose a novel framework to build descriptors of local intensity that are invariant to general deformations. In this framework, an image is embedded as a 2D surface in 3D spac...
Haibin Ling, David W. Jacobs