Sciweavers

2542 search results - page 278 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CVPR
2012
IEEE
13 years 2 months ago
Bag of textons for image segmentation via soft clustering and convex shift
We propose an unsupervised image segmentation method based on texton similarity and mode seeking. The input image is first convolved with a filter-bank, followed by soft cluster...
Zhiding Yu, Ang Li, Oscar C. Au, Chunjing Xu
120
Voted
PE
2008
Springer
167views Optimization» more  PE 2008»
15 years 14 days ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi
120
Voted
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 25 days ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 6 months ago
A developmental genetics-inspired approach to robot control
The need to build modular, scalable, and complex technology capable of adaptation, self-assembly, and self-repair has fuelled renewed interest in using approaches inspired by deve...
Sanjeev Kumar
ASAP
2003
IEEE
141views Hardware» more  ASAP 2003»
15 years 5 months ago
Automatic Instruction Set Extension and Utilization for Embedded Processors
There is a growing demand for application-specific embedded processors in system-on-a-chip designs. Current tools and design methodologies often require designers to manually spec...
Armita Peymandoust, Laura Pozzi, Paolo Ienne, Giov...