Sciweavers

1720 search results - page 107 / 344
» eg 2008
Sort
View
FAC
2008
100views more  FAC 2008»
15 years 4 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
NIPS
2008
15 years 6 months ago
Beyond Novelty Detection: Incongruent Events, when General and Specific Classifiers Disagree
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
Daphna Weinshall, Hynek Hermansky, Alon Zweig, Jie...
SIGOPS
2008
104views more  SIGOPS 2008»
15 years 4 months ago
PipesFS: fast Linux I/O in the unix tradition
This paper presents PipesFS, an I/O architecture for Linux 2.6 that increases I/O throughput and adds support for heterogeneous parallel processors by (1) collapsing many I/O inte...
Willem de Bruijn, Herbert Bos
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
15 years 4 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
BCSHCI
2008
15 years 6 months ago
The roles of time, place, value and relationships in collocated photo sharing with camera phones
Photo sharing on camera phones is becoming a common way to maintain closeness and relationships with friends and family. How people share their photos in collocated settings using...
Hanna Stelmaszewska, Bob Fields, Ann Blandford