Sciweavers

6740 search results - page 369 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
125
Voted
DBPL
1993
Springer
95views Database» more  DBPL 1993»
15 years 8 months ago
A Moose and a Fox Can Aid Scientists with Data Management Problems
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments, an object-oriented data model at the core of a scient...
Janet L. Wiener, Yannis E. Ioannidis
EKNOW
2009
15 years 2 months ago
Visual Middle-Out Modeling of Problem Spaces
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...
Andrea Valente
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 6 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
15 years 10 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
15 years 5 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...