Sciweavers

994 search results - page 166 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
SPAA
2003
ACM
14 years 19 days ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
IPPS
1999
IEEE
13 years 11 months ago
High-Performance Knowledge Extraction from Data on PC-Based Networks of Workstations
The automatic construction of classi ers programs able to correctly classify data collected from the real world is one of the major problems in pattern recognition and in a wide ar...
Cosimo Anglano, Attilio Giordana, Giuseppe Lo Bell...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
SIBGRAPI
2009
IEEE
14 years 2 months ago
Learning Discriminative Appearance-Based Models Using Partial Least Squares
Appearance information is essential for applications such as tracking and people recognition. One of the main problems of using appearance-based discriminative models is the ambig...
William Robson Schwartz, Larry S. Davis
ECCV
2002
Springer
14 years 9 months ago
All the Images of an Outdoor Scene
The appearance of an outdoor scene depends on a variety of factors such as viewing geometry, scene structure and reflectance (BRDF or BTF), illumination (sun, moon, stars, street l...
Srinivasa G. Narasimhan, Chi Wang, Shree K. Nayar