Sciweavers

4708 search results - page 684 / 942
» Generating the Structure of Argument
Sort
View
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 6 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
162
Voted
PPOPP
2009
ACM
16 years 6 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 6 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
KDD
2003
ACM
128views Data Mining» more  KDD 2003»
16 years 6 months ago
Similarity analysis on government regulations
Government regulations are semi-structured text documents that are often voluminous, heavily cross-referenced between provisions and even ambiguous. Multiple sources of regulation...
Gloria T. Lau, Kincho H. Law, Gio Wiederhold
CHI
2005
ACM
16 years 6 months ago
Supporting efficient development of cognitive models at multiple skill levels: exploring recent advances in constraint-based mod
This paper presents X-PRT, a new cognitive modeling tool supporting activities ranging from interface design to basic cognitive research. X-PRT provides a graphical model developm...
Irene Tollinger, Richard L. Lewis, Michael McCurdy...