Sciweavers

1132 search results - page 84 / 227
» Structural Average Case Complexity
Sort
View
ISCIS
2005
Springer
14 years 2 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
CCCG
2010
13 years 10 months ago
On degeneracy of lower envelopes of algebraic surfaces
We analyze degeneracy of lower envelopes of algebraic surfaces. We focus on the cases omitted in the existing complexity analysis of lower envelopes [Halperin and Sharir 1993], an...
Kimikazu Kato
CSR
2007
Springer
14 years 3 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
EDBT
2006
ACM
103views Database» more  EDBT 2006»
14 years 9 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
ECAI
2000
Springer
14 years 1 months ago
A Property of Path Inverse Consistency Leading to an Optimal PIC Algorithm
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
Romuald Debruyne