Sciweavers

3265 search results - page 125 / 653
» Representing Groups on Graphs
Sort
View
129
Voted
SOFSEM
2009
Springer
16 years 25 days ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
122
Voted
ICDT
1997
ACM
90views Database» more  ICDT 1997»
15 years 8 months ago
Adding Structure to Unstructured Data
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
Peter Buneman, Susan B. Davidson, Mary F. Fernande...
124
Voted
LCPC
1991
Springer
15 years 7 months ago
An Executable Representation of Distance and Direction
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
Richard Johnson, Wei Li, Keshav Pingali
147
Voted
ICONIP
2008
15 years 5 months ago
Neurocognitive Approach to Clustering of PubMed Query Results
Abstract. Internet literature queries return a long lists of citations, ordered according to their relevance or date. Query results may also be represented using Visual Language th...
Pawel Matykiewicz, Wlodzislaw Duch, Paul M. Zender...
137
Voted
TRECVID
2008
15 years 5 months ago
ISM TRECVID2008 High-level Feature Extraction
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
Tomoko Matsui, Jean-Philippe Vert, Shin'ichi Satoh...