Sciweavers

1805 search results - page 165 / 361
» Functional programming with structured graphs
Sort
View
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 1 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
CP
2004
Springer
15 years 6 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
TOOLS
2010
IEEE
15 years 6 months ago
Read-Only Execution for Dynamic Languages
Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically t...
Jean-Baptiste Arnaud, Marcus Denker, Stépha...
IEEEPACT
2007
IEEE
15 years 7 months ago
Error Detection Using Dynamic Dataflow Verification
Continued scaling of CMOS technology to smaller transistor sizes makes modern processors more susceptible to both transient and permanent hardware faults. Circuitlevel techniques ...
Albert Meixner, Daniel J. Sorin
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
15 years 5 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...