Sciweavers

271 search results - page 2 / 55
» Comparison of two interactive search refinement techniques
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
CSC
2008
13 years 10 months ago
Multilevel Approaches applied to the Capacitated Clustering Problem
- This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aidin...
Demane Rodney, Alan Soper, Chris Walshaw
EVOW
2008
Springer
13 years 10 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
INTERACT
2007
13 years 10 months ago
A Comparison of Navigation Techniques Across Different Types of Off-Screen Navigation Tasks
In many systems such as PDAs, users access data through a limited viewport. This means that users have to frequently navigate to regions that are off-screen to view important conte...
Grant Partridge, Mahtab Nezhadasl, Pourang Irani, ...
ENC
2006
IEEE
14 years 6 days ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...