Sciweavers

1272 search results - page 80 / 255
» The Set Cover with Pairs Problem
Sort
View
ICFCA
2004
Springer
15 years 6 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
ECCV
2002
Springer
16 years 2 months ago
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"
There has been considerable success in automated reconstruction for image sequences where small baseline algorithms can be used to establish matches across a number of images. In c...
Frederik Schaffalitzky, Andrew Zisserman
ASUNAM
2010
IEEE
15 years 2 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
91
Voted
LREC
2010
206views Education» more  LREC 2010»
15 years 2 months ago
Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain
In this paper we evaluate the performance of multilabel classification algorithms on the EUR-Lex database of legal documents of the European Union. On the same set of underlying d...
Eneldo Loza Mencía, Johannes Fürnkranz
102
Voted
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 5 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin