Sciweavers

511 search results - page 50 / 103
» More Precise Partition Abstractions
Sort
View
TJS
2002
122views more  TJS 2002»
13 years 8 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
Jean Frédéric Myoupo, David Sem&eacu...
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 8 months ago
Efficient Isomorphism Testing for a Class of Group Extensions
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
François Le Gall
DGCI
2008
Springer
13 years 10 months ago
On Watershed Cuts and Thinnings
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
MST
2010
98views more  MST 2010»
13 years 7 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
DLOG
2010
13 years 6 months ago
A MapReduce Algorithm for EL+
Abstract. Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion...
Raghava Mutharaju, Frederick Maier, Pascal Hitzler