Sciweavers

3047 search results - page 17 / 610
» Randomized Parallel Selection
Sort
View
JSAC
2007
83views more  JSAC 2007»
13 years 7 months ago
Constructing an optimal server set in structured peer-to-peer networks
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Seung Chul Han, Ye Xia
CIAC
2006
Springer
84views Algorithms» more  CIAC 2006»
13 years 11 months ago
In-Place Randomized Slope Selection
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
Henrik Blunck, Jan Vahrenhold
UC
2009
Springer
14 years 2 months ago
Random Number Selection in Self-assembly
Abstract. We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range {...
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott...
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
14 years 1 months ago
Feature selection in conditional random fields for activity recognition
Abstract— Temporal classification, such as activity recognition, is a key component for creating intelligent robot systems. In the case of robots, classification algorithms mus...
Douglas L. Vail, John D. Lafferty, Manuela M. Velo...
ICML
2004
IEEE
14 years 8 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu