Sciweavers

3471 search results - page 676 / 695
» Obstacle Numbers of Graphs
Sort
View
CANS
2006
Springer
136views Cryptology» more  CANS 2006»
15 years 1 months ago
Watermarking Essential Data Structures for Copyright Protection
Software watermarking is a new research area that aims at providing copyright protection for commercial software. It minimizes software piracy by hiding copyright signatures inside...
Qutaiba Albluwi, Ibrahim Kamel
COMPGEOM
2006
ACM
15 years 1 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
CPAIOR
2006
Springer
15 years 1 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
76
Voted
ICSE
2000
IEEE-ACM
15 years 1 months ago
Testing levels for object-oriented software
One of the characteristicsof object-oriented software is the complex dependency that may exist between classes due to inheritance, association and aggregation relationships. Hence...
Yvan Labiche, Pascale Thévenod-Fosse, H&eac...
SIGGRAPH
1991
ACM
15 years 1 months ago
Visibility preprocessing for interactive walkthroughs
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
Seth J. Teller, Carlo H. Séquin