Sciweavers

2168 search results - page 381 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
107
Voted
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 2 months ago
An information-theoretic approach to normal forms for relational and XML data
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
Marcelo Arenas, Leonid Libkin
125
Voted
ICSE
2008
IEEE-ACM
16 years 2 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto
102
Voted
WSDM
2010
ACM
215views Data Mining» more  WSDM 2010»
16 years 23 hour ago
Boilerplate Detection using Shallow Text Features
In addition to the actual content Web pages consist of navigational elements, templates, and advertisements. This boilerplate text typically is not related to the main content, ma...
Christian Kohlschütter, Peter Fankhauser, Wol...
131
Voted
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
15 years 11 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
115
Voted
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 9 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu