Sciweavers

532 search results - page 41 / 107
» Think globally, search locally
Sort
View
MM
2004
ACM
99views Multimedia» more  MM 2004»
15 years 3 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...
CVPR
2009
IEEE
16 years 5 months ago
Recognizing Linked Events: Searching the Space of Feasible Explanations
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
Dima Damen (University of Leeds), David Hogg (Univ...
AAAI
1996
14 years 11 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
BMCBI
2007
115views more  BMCBI 2007»
14 years 9 months ago
Local comparison of protein structures highlights cases of convergent evolution in analogous functional sites
Background: We performed an exhaustive search for local structural similarities in an ensemble of non-redundant protein functional sites. With the purpose of finding new examples ...
Gabriele Ausiello, Daniele Peluso, Allegra Via, Ma...
IWPEC
2009
Springer
15 years 4 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke