Sciweavers

1983 search results - page 15 / 397
» Competitive graph searches
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
13 years 5 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 8 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
WINE
2009
Springer
172views Economy» more  WINE 2009»
14 years 2 months ago
An Online Multi-unit Auction with Improved Competitive Ratio
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
Sourav Chakraborty, Nikhil R. Devanur
EUSFLAT
2003
165views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Genetic fuzzy systems to evolve coordination strategies in competitive distributed systems
This paper suggests an evolutionary approach to design coordination strategies, a key issue in distributed intelligent systems. We focus on competitive strategies in the form of f...
Igor Walter, Fernando A. C. Gomide