Sciweavers

2027 search results - page 329 / 406
» When is it best to best-respond
Sort
View
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 1 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
117
Voted
CHI
2005
ACM
16 years 1 months ago
Connecting with kids: so what's new?
From pre-schools to high schools, at home and in museums, the educational community has embraced the use of computers as a teaching tool. Yet many institutions will simply install...
Lori L. Scarlatos, Amy Bruckman, Allison Druin, Mi...
80
Voted
HPCA
2006
IEEE
16 years 1 months ago
Retention-aware placement in DRAM (RAPID): software methods for quasi-non-volatile DRAM
Measurements of an off-the-shelf DRAM chip confirm that different cells retain information for different amounts of time. This result extends to DRAM rows, or pages (retention tim...
Ravi K. Venkatesan, Stephen Herr, Eric Rotenberg
111
Voted
CHI
2004
ACM
16 years 1 months ago
Older adults and web usability: is web experience the same as web expertise?
Level of Web experience is often a factor for which researchers attempt to control while conducting experimental studies on Web usability. It is typically measured by some means o...
Ann Chadwick-Dias, Donna P. Tedesco, Thomas S. Tul...
158
Voted
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 1 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau