Sciweavers

1550 search results - page 66 / 310
» Optimizing search by showing results in context
Sort
View
IDEAL
2009
Springer
13 years 6 months ago
Optimizing Data Transformations for Classification Tasks
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
José María Valls, Ricardo Aler
CVPR
2006
IEEE
14 years 11 months ago
An Integrated Model of Top-Down and Bottom-Up Attention for Optimizing Detection Speed
Integration of goal-driven, top-down attention and image-driven, bottom-up attention is crucial for visual search. Yet, previous research has mostly focused on models that are pur...
Vidhya Navalpakkam, Laurent Itti
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 3 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 9 months ago
Sponsored Search Auctions with Markovian Users
Abstract. Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auct...
Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Mar...
GLOBECOM
2006
IEEE
14 years 3 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang