Sciweavers

840 search results - page 155 / 168
» Open multi-methods for c
Sort
View
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 4 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
ICCS
1999
Springer
15 years 4 months ago
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...
Guy W. Mineau, Gerd Stumme, Rudolf Wille
FGR
1998
IEEE
268views Biometrics» more  FGR 1998»
15 years 4 months ago
A Virtual Mirror Interface Using Real-Time Robust Face Tracking
We describe a virtual mirror interface which can react to people using robust, real-time face tracking. Our display can directly combine a user's face with various graphical ...
Trevor Darrell, Gaile G. Gordon, John Woodfill, Mi...
HPDC
1997
IEEE
15 years 3 months ago
A Secure Communications Infrastructure for High-Performance Distributed Computing
We describe a software infrastructure designed to support the development of applications that use high-speed networks to connect geographically distributed supercomputers, databa...
Ian T. Foster, Nicholas T. Karonis, Carl Kesselman...
SIGMOD
1997
ACM
166views Database» more  SIGMOD 1997»
15 years 3 months ago
The InfoSleuth Project
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
Roberto J. Bayardo Jr., William Bohrer, Richard S....