Sciweavers

2304 search results - page 394 / 461
» On the Vulnerability of Large Graphs
Sort
View
IADIS
2004
14 years 1 days ago
The outline of an 'intelligent' image retrieval engine
The first image retrieval systems hold the advantage of being fully automatic, and thus scalable to large collections of images but are restricted to the representation of low-lev...
Mohammed Belkhatir, Philippe Mulhem, Yves Chiarame...
FMOODS
2006
14 years 1 days ago
Generating Instance Models from Meta Models
Meta modeling is a wide-spread technique to define visual languages, with the UML being the most prominent one. Despite several advantages of meta modeling such as ease of use, the...
Karsten Ehrig, Jochen Malte Küster, Gabriele ...
FLAIRS
2003
14 years 1 days ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
P2PKM
2004
14 years 1 days ago
RDFGrowth, a P2P annotation exchange algorithm for scalable Semantic Web applications
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
Giovanni Tummarello, Christian Morbidoni, Joackin ...
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 23 hour ago
Frugality in path auctions
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
Edith Elkind, Amit Sahai, Kenneth Steiglitz