Sciweavers

1170 search results - page 195 / 234
» How Fast Is Too Fast
Sort
View
CPAIOR
2007
Springer
15 years 8 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
DSN
2000
IEEE
15 years 7 months ago
On the Quality of Service of Failure Detectors
ÐWe study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how we...
Wei Chen, Sam Toueg, Marcos Kawazoe Aguilera
153
Voted
SIGSOFT
2010
ACM
15 years 15 days ago
Growth of newcomer competence: challenges of globalization
The transfer of entire projects to offshore locations, the aging and renewal of core developers in legacy products, the recruiting in fast growing Internet companies, and the part...
Minghui Zhou, Audris Mockus
136
Voted
CCR
2005
103views more  CCR 2005»
15 years 2 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
123
Voted
ICCV
2009
IEEE
16 years 7 months ago
Active Appearance Models with Rotation Invariant Kernels
2D Active Appearance Models (AAM) and 3D Morphable Models (3DMM) are widely used techniques. AAM provide a fast fitting process, but may represent unwanted 3D transformations un...
Onur C. Hamsici, Aleix M. Martinez