Sciweavers

17505 search results - page 3130 / 3501
» Use Cases as Workflows
Sort
View
CHI
2005
ACM
16 years 7 months ago
Examining task engagement in sensor-based statistical models of human interruptibility
The computer and communication systems that office workers currently use tend to interrupt at inappropriate times or unduly demand attention because they have no way to determine ...
James Fogarty, Andrew Jensen Ko, Htet Htet Aung, E...
CHI
2001
ACM
16 years 7 months ago
Layered participatory analysis: new developments in the CARD technique
CARD (Collaborative Analysis of Requirements and Design) is an influential technique for participatory design and participatory analysis that is in use on three continents. This p...
Michael J. Muller
CADE
2005
Springer
16 years 7 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
177
Voted
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 7 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
« Prev « First page 3130 / 3501 Last » Next »