3008 search results - page 517 / 602 » Independence in connected graphs |
182
click to vote
ICCSA
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
156
click to vote
MFCS
2007
Springer
16 years 15 days ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
156
click to vote
MODELS
2007
Springer
16 years 15 days ago
2007
Springer
In this paper we introduce a novel wide-profile graphical tool-building platform GrTP which is based on the principle of separating semantic domain model processing and user inter...
159
click to vote
SACRYPT
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. Side-channel collision attacks were proposed in [1] and applied to AES in [2]. These are based on detecting collisions in certain positions of the internal state after th...
142
click to vote
AICT
2006
IEEE
16 years 13 days ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...