Sciweavers

9842 search results - page 1503 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
DANTE
1999
IEEE
150views Database» more  DANTE 1999»
15 years 11 months ago
Modeling and Executing the Data Warehouse Refreshment Process
Data warehouse refreshment is often viewed as a problem of maintaining materialized views over operational sources. In this paper, we show that the data warehouse refreshment proc...
Athanasios Vavouras, Stella Gatziu, Klaus R. Dittr...
DEXAW
1999
IEEE
75views Database» more  DEXAW 1999»
15 years 11 months ago
Coordination of Security Levels for Internet Architectures
Internet systems provide a variety of ways to exchange information, contain large amounts and variety of data, and have become quite complex, making them vulnerable to attacks fro...
Eduardo B. Fernández
SIGMOD
1999
ACM
136views Database» more  SIGMOD 1999»
15 years 11 months ago
Query Rewriting for Semistructured Data
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
Yannis Papakonstantinou, Vasilis Vassalos
ICCV
1999
IEEE
15 years 11 months ago
A Subset Approach to Contour Tracking in Clutter
A new method for tracking contours of moving objects in clutter is presented. For a given object, a model of its contours is learned from training data in the form of a subset of ...
Daniel Freedman, Michael S. Brandstein
ICDCS
1999
IEEE
15 years 11 months ago
The Inter-group Router Approach to Scalable Group Composition
This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups, while maintaining well-defined end-to-en...
Scott Johnson, Farnam Jahanian, Jigney Shah
« Prev « First page 1503 / 1969 Last » Next »