Sciweavers

4037 search results - page 409 / 808
» Routing without ordering
Sort
View
141
Voted
RT
2000
Springer
15 years 7 months ago
Real-Time Rendering of Densely Populated Urban Environments
Abstract. In this paper we present some preliminary results concerning a realtime visualisation system for densely populated urban environments. In order to be able to render the l...
Franco Tecchia, Yiorgos Chrysanthou
ICMCS
1995
IEEE
115views Multimedia» more  ICMCS 1995»
15 years 7 months ago
Secure Pay-Per-View Testbed
Trials of Video on Demand and Pay-Per-View systems are underway in many countries, and as a result, many cable and telecommunications companies are having to upgrade or replace th...
Dónal Cunningham, Donal O'Mahony
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
15 years 7 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
130
Voted
VLDB
1991
ACM
143views Database» more  VLDB 1991»
15 years 7 months ago
Adaptive Locking Strategies in a Multi-node Data Sharing Environment
This paper describes some of the concurrency control 1” lgorithms used in RdMVMS RdbIVMS uses the ,fac.ilities provided by the VMS lock manager in order to perform locking among...
Ashok M. Joshi
102
Voted
ICPR
2010
IEEE
15 years 7 months ago
Probabilistic Clustering Using the Baum-Eagon Inequality
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
Samuel Rota Bulo', Marcello Pelillo