Sciweavers

4757 search results - page 811 / 952
» Generalized Posynomial Performance Modeling
Sort
View
CORR
2010
Springer
47views Education» more  CORR 2010»
13 years 9 months ago
Lower bounds for the error decay incurred by coarse quantization schemes
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
Felix Krahmer, Rachel Ward
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 9 months ago
RubberEdge: Reducing Clutching by Combining Position and Rate Control with Elastic Feedback
Position control devices enable precise selection, but significant clutching degrades performance. Clutching can be reduced with high control-display gain or pointer acceleration,...
Géry Casiez, Daniel Vogel, Qing Pan, Christ...
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 9 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
ENTCS
2006
145views more  ENTCS 2006»
13 years 9 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 9 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle