Sciweavers

251 search results - page 3 / 51
» Using self-dissimilarity to quantify complexity
Sort
View
KDID
2004
137views Database» more  KDID 2004»
13 years 8 months ago
Condensed Representation of EPs and Patterns Quantified by Frequency-Based Measures
Emerging patterns (EPs) are associations of features whose frequencies increase significantly from one class to another. They have been proven useful to build powerful classifiers ...
Arnaud Soulet, Bruno Crémilleux, Fran&ccedi...
COMCOM
2006
89views more  COMCOM 2006»
13 years 7 months ago
Quantifying the effects of recent protocol improvements to TCP: Impact on Web performance
We assess the state of Internet congestion control and error recovery through a controlled study that considers the integration of standards-track TCP error recovery and both TCP ...
Michele C. Weigle, Kevin Jeffay, F. Donelson Smith
JSYML
2008
73views more  JSYML 2008»
13 years 7 months ago
Examining fragments of the quantified propositional calculus
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
Steven Perron
AUSDM
2008
Springer
237views Data Mining» more  AUSDM 2008»
13 years 9 months ago
On Inconsistencies in Quantifying Strength of Community Structures
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...
Wen Haw Chong
SIGSOFT
2007
ACM
14 years 7 months ago
Quantifying the effectiveness of testing via efficient residual path profiling
Software testing is extensively used for uncovering bugs in large, complex software. Testing relies on well designed regression test suites that anticipate all reasonable software...
Trishul M. Chilimbi, Aditya V. Nori, Kapil Vaswani