Sciweavers

1275 search results - page 119 / 255
» time 1998
Sort
View
COCOON
2005
Springer
14 years 2 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
SIGUCCS
1999
ACM
14 years 1 months ago
Usability Testing: A Quick, Cheap, and Effective Method
The University of Portland Office of Computer and Telecommunication Services (CTS) created an Intranet web site for the University community during the summer of 1998. In the summ...
Jerilyn Prescott, Matt Crichton
CGI
1998
IEEE
14 years 1 months ago
An Architecture of a Universal DBMS for Graphics Applications
This paper presents a new architecture of a database management system intended to be used together with existing graphics software. In the first place, a system with this archite...
Andrey Collison, Hanspeter Bieri
CGI
1998
IEEE
14 years 1 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
CGI
1998
IEEE
14 years 1 months ago
Incremental Techniques for Implicit Surface Modeling
This paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. Our method lends itself for an interactive modeling system as the ...
Eric Galin, Samir Akkouche