Sciweavers

2609 search results - page 321 / 522
» Optimizing for parallelism and data locality
Sort
View
CCGRID
2003
IEEE
15 years 11 months ago
An Overlay-Network Approach for Distributed Access to SRS
SRS is a widely used system for integrating biological databases. Currently, SRS relies only on locally provided copies of these databases. In this paper we propose a mechanism th...
Thomas Fuhrmann, Andrea Schafferhans, Thure Etzol
195
Voted
CVPR
2003
IEEE
15 years 11 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
189
Voted
TOG
2008
116views more  TOG 2008»
15 years 6 months ago
A photometric approach for estimating normals and tangents
This paper presents a technique for acquiring the shape of realworld objects with complex isotropic and anisotropic reflectance. Our method estimates the local normal and tangent ...
Michael Holroyd, Jason Lawrence, Greg Humphreys, T...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 9 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
144
Voted
ICDM
2003
IEEE
140views Data Mining» more  ICDM 2003»
15 years 11 months ago
Mining Frequent Itemsets in Distributed and Dynamic Databases
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...