Sciweavers

668 search results - page 73 / 134
» Algorithmics and Applications of Tree and Graph Searching
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 2 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 8 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
146
Voted
ICVS
2003
Springer
15 years 7 months ago
Automatic Mapping of Settlement Areas Using a Knowledge-Based Image Interpretation System
Abstract. We introduce the knowledge-based image interpretation system GeoAIDA and give examples for an image operator, extracting trees from aerial imagery. Moreover we present a ...
Bernd-Michael Straub, Markus Gerke, Martin Pahl
138
Voted
NIPS
2001
15 years 3 months ago
Convolution Kernels for Natural Language
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
Michael Collins, Nigel Duffy
119
Voted
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 2 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...