Sciweavers

516 search results - page 92 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 4 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 4 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 10 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi