Sciweavers

948 search results - page 186 / 190
» What can we achieve by arbitrary announcements
Sort
View
ISCA
2002
IEEE
68views Hardware» more  ISCA 2002»
14 years 12 days ago
Timekeeping in the Memory System: Predicting and Optimizing Memory Behavior
Techniques for analyzing and improving memory referencing behavior continue to be important for achieving good overall program performance due to the ever-increasing performance g...
Zhigang Hu, Margaret Martonosi, Stefanos Kaxiras
CSCWD
2001
Springer
13 years 12 months ago
Update Algorithms for the Sketch Data Model
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
Michael Johnson, Robert D. Rosebrugh
COMPGEOM
2005
ACM
13 years 9 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
CSCW
2008
ACM
13 years 9 months ago
Understanding the implications of social translucence for systems supporting communication at work
In this paper we describe a study that explored the implications of the Social Translucence framework for designing systems that support communications at work. Two systems design...
Agnieszka Matysiak Szóstek, Evangelos Karap...
CVPR
2006
IEEE
14 years 9 months ago
Joint Boosting Feature Selection for Robust Face Recognition
A fundamental challenge in face recognition lies in determining what facial features are important for the identification of faces. In this paper, a novel face recognition framewo...
Rong Xiao, Wu-Jun Li, Yuandong Tian, Xiaoou Tang