Sciweavers

1332 search results - page 27 / 267
» An Efficient Algorithm for the Approximate Median Selection ...
Sort
View
CATS
2006
13 years 9 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
AI
2005
Springer
13 years 8 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
DAC
2009
ACM
14 years 9 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
CIARP
2010
Springer
13 years 5 months ago
A New Algorithm for Training SVMs Using Approximate Minimal Enclosing Balls
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
Emanuele Frandi, Maria Grazia Gasparo, Stefano Lod...
GSN
2009
Springer
14 years 9 days ago
Efficient Viewpoint Selection for Urban Texture Documentation
We envision participatory texture documentation (PTD) as a process in which a group of participants (dedicated individuals and/or general public) with camera-equipped mobile phones...
Houtan Shirani-Mehr, Farnoush Banaei Kashani, Cyru...