Sciweavers

2168 search results - page 308 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
136
Voted
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
15 years 9 months ago
Shape Measure for Identifying Perceptually Informative Parts of 3D Objects
We propose a mathematical approach for quantifying shape complexity of 3D surfaces based on perceptual principles of visual saliency. Our curvature variation measure (CVM), as a 3...
Sreenivas R. Sukumar, David Page, Andrei V. Gribok...
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
INFOCOM
2003
IEEE
15 years 8 months ago
Instability Phenomena in Underloaded Packet Networks with QoS Schedulers
— Instability in packet-switching networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload gene...
Marco Ajmone Marsan, Mirko Franceschinis, Emilio L...
ISCAS
2003
IEEE
172views Hardware» more  ISCAS 2003»
15 years 8 months ago
Efficient symbol synchronization techniques using variable FIR or IIR interpolation filters
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
Martin Makundi, Timo I. Laakso
FM
1999
Springer
97views Formal Methods» more  FM 1999»
15 years 7 months ago
Sensors and Actuators in TCOZ
Timed Communicating Object Z (TCOZ) combines Object-Z's strengths in modeling complex data and algorithms with Timed CSP's strengths in modeling real-time concurrency. TC...
Brendan P. Mahony, Jin Song Dong