Sciweavers

372 search results - page 45 / 75
» On Finding Small 2-Generating Sets
Sort
View
CC
2009
Springer
141views System Software» more  CC 2009»
14 years 10 months ago
Compile-Time Analysis and Specialization of Clocks in Concurrent Programs
Abstract. Clocks are a mechanism for providing synchronization barriers in concurrent programming languages. They are usually implemented using primitive communication mechanisms a...
Nalini Vasudevan, Olivier Tardieu, Julian Dolby, S...
CP
2009
Springer
14 years 10 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
CHI
2005
ACM
14 years 10 months ago
Design requirements for more flexible structured editors from a study of programmers' text editing
A detailed study of Java programmers' text editing found that the full flexibility of unstructured text was not utilized for the vast majority of programmers' character-...
Andrew Jensen Ko, Htet Htet Aung, Brad A. Myers
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 10 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 4 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...