Sciweavers

1596 search results - page 289 / 320
» Quantum property testing
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 8 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
CHI
2007
ACM
14 years 8 months ago
Hard lessons: effort-inducing interfaces benefit spatial learning
Interface designers normally strive for a design that minimises the user's effort. However, when the design's objective is to train users to interact with interfaces tha...
Andy Cockburn, Per Ola Kristensson, Jason Alexande...
CHI
2004
ACM
14 years 8 months ago
Unintended effects: varying icon spacing changes users' visual search strategy
Users of modern GUIs routinely engage in visual searches for various control items, such as buttons and icons. Because this is so ubiquitous, it is important that the visual prope...
Sarah P. Everett, Michael D. Byrne
POPL
2005
ACM
14 years 8 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...