Sciweavers

1132 search results - page 136 / 227
» Structural Average Case Complexity
Sort
View
CSMR
2008
IEEE
14 years 3 months ago
Package Reference Fingerprint: a Rich and Compact Visualization to Understand Package Relationships
Object-oriented languages such as Java, Smalltalk, and C++ structure their programs using packages, allowing classes to be organized into named abstractions. Maintainers of large ...
Hani Abdeen, Ilham Alloui, Stéphane Ducasse...
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
14 years 3 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
14 years 2 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky
CIKM
1997
Springer
14 years 1 months ago
An Analysis of Cardinality Constraints in Redundant Relationships
In this paper, we present a complete analysis of redundant relationships in the entity-relationship model. Existing approaches use the concept of functional dependencies for ident...
James Dullea, Il-Yeol Song
CP
2007
Springer
14 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti