Sciweavers

1830 search results - page 303 / 366
» Workshop on Graph Computation Models
Sort
View
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
14 years 1 months ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain
ECCV
2010
Springer
14 years 26 days ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
PODS
1991
ACM
98views Database» more  PODS 1991»
14 years 13 days ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
IWCMC
2010
ACM
13 years 11 months ago
A flow trace generator using graph-based traffic classification techniques
We propose a novel methodology to generate realistic network flow traces to enable systematic evaluation of network monitoring systems in various traffic conditions. Our technique...
Peter Siska, Marc Ph. Stoecklin, Andreas Kind, Tor...
EUROPAR
2010
Springer
13 years 10 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
Huanyu Zhao, Xin Yang, Xiaolin Li