Sciweavers

820 search results - page 3 / 164
» Finding low-utility data structures
Sort
View
EUROSYS
2011
ACM
12 years 8 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
CHI
1995
ACM
13 years 9 months ago
Finding and Using Implicit Structure in Human-Organized Spatial Layouts of Information
Many interfaces allow users to manipulate graphical objects, icons representing underlying data or the data themselves, against a spatial backdrop or canvas. Users take advantage ...
Frank M. Shipman III, Catherine C. Marshall, Thoma...
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
13 years 11 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
ECCV
2010
Springer
13 years 10 months ago
Finding Semantic Structures in Image Hierarchies using Laplacian Graph Energy
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
WWW
2007
ACM
14 years 6 months ago
Finding community structure in mega-scale social networks: [extended abstract]
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
Ken Wakita, Toshiyuki Tsurumi