Sciweavers

1081 search results - page 52 / 217
» Working with the LR Degrees
Sort
View
CAGD
2008
99views more  CAGD 2008»
15 years 26 days ago
Topology and arrangement computation of semi-algebraic planar curves
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
Lionel Alberti, Bernard Mourrain, Julien Wintz
101
Voted
DM
2008
81views more  DM 2008»
15 years 25 days ago
The diameter of protean graphs
Abstract. The web graph is a real-world self-organizing network whose vertices correspond to web pages, and whose edges correspond to links between pages. Many stochastic models fo...
Pawel Pralat
97
Voted
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 22 days ago
Enrichment of Qualitative Beliefs for Reasoning under Uncertainty
– This paper deals with enriched qualitative belief functions for reasoning under uncertainty and for combining information expressed in natural language through linguistic label...
Xinde Li, Xinhan Huang, Florentin Smarandache, Jea...
JGAA
2006
127views more  JGAA 2006»
15 years 22 days ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
105
Voted
SIGCSE
2008
ACM
136views Education» more  SIGCSE 2008»
15 years 20 days ago
A new paradigm for programming competitions
The annual ACM International Collegiate Programming Contest produces a competitive paradigm that is at odds with the pedagogical goals of modern computer science and software engi...
James F. Bowring