Sciweavers

1576 search results - page 95 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ICDE
2002
IEEE
175views Database» more  ICDE 2002»
15 years 17 days ago
Detecting Changes in XML Documents
We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses ca...
Gregory Cobena, Serge Abiteboul, Amélie Mar...
ATAL
2010
Springer
14 years 9 days ago
Infinite order Lorenz dominance for fair multiagent optimization
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
Boris Golden, Patrice Perny
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 5 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
AI
2010
Springer
13 years 11 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ICCV
2003
IEEE
15 years 1 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah