Sciweavers

1442 search results - page 33 / 289
» Finding interesting things
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 5 days ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
DCG
2008
104views more  DCG 2008»
13 years 8 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
TIP
2008
124views more  TIP 2008»
13 years 8 months ago
GAFFE: A Gaze-Attentive Fixation Finding Engine
Abstract-- The ability to automatically detect visually interesting regions in images has many practical applications, especially in the design of active machine vision and automat...
Umesh Rajashekar, Ian van der Linde, Alan C. Bovik...
FCSC
2007
130views more  FCSC 2007»
13 years 8 months ago
An improved algorithm for finding community structure in networks with an application to IPv6 backbone network
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent years. One category of algorithms for detecting community struct...
Yingxin Guo, Ke Xu
IJMI
2002
82views more  IJMI 2002»
13 years 8 months ago
Protein names and how to find them
A prerequisite for all higher level information extraction tasks is the identication of unknown names in text. Today, when large corpora can consist of billions of words, it is of...
Kristofer Franzén, Gunnar Eriksson, Fredrik...