Sciweavers

3415 search results - page 544 / 683
» Lower Bounds for Kernelizations
Sort
View
VMCAI
2005
Springer
15 years 10 months ago
Checking Herbrand Equalities and Beyond
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
Markus Müller-Olm, Oliver Rüthing, Helmu...
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 10 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
COMPGEOM
2004
ACM
15 years 10 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
MIR
2004
ACM
110views Multimedia» more  MIR 2004»
15 years 9 months ago
Symbolic representation and retrieval of moving object trajectories
Searching moving object trajectories of video databases has been applied to many fields, such as video data analysis, content-based video retrieval, video scene classification. ...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
PODC
2004
ACM
15 years 9 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen