Sciweavers

7773 search results - page 256 / 1555
» On generalized Frame-Stewart numbers
Sort
View
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 7 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
CHI
2008
ACM
16 years 7 months ago
Ninja cursors: using multiple cursors to assist target acquisition on large screens
We propose the "ninja cursor" to improve the performance of target acquisition, particularly on large screens. This technique uses multiple distributed cursors to reduce...
Masatomo Kobayashi, Takeo Igarashi
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 6 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
16 years 6 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
OSDI
2008
ACM
16 years 6 months ago
Disk Drive Workload Captured in Logs Collected During the Field Return Incoming Test
Hard disk drives returned back to Seagate undergo the Field Return Incoming Test. During the test, the available logs in disk drives are collected, if possible. These logs contain...
Alma Riska, Erik Riedel