Sciweavers

6300 search results - page 1115 / 1260
» We have it easy, but do we have it right
Sort
View
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 3 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
ICML
1997
IEEE
16 years 2 months ago
Robot Learning From Demonstration
The goal of robot learning from demonstration is to have a robot learn from watching a demonstration of the task to be performed. In our approach to learning from demonstration th...
Christopher G. Atkeson, Stefan Schaal
CCS
2009
ACM
16 years 1 months ago
Logging key assurance indicators in business processes
Management of a modern enterprise is based on the assumption that executive reports of lower-layer management are faithful to what is actually happening in the field. As some well...
Fabio Massacci, Gene Tsudik, Artsiom Yautsiukhin
CHI
2009
ACM
16 years 1 months ago
Visualizing real-time language-based feedback on teamwork behavior in computer-mediated groups
While most collaboration technologies are concerned with supporting particular tasks such as workflows or meetings, many work groups do not have the teamwork skills essential to e...
Gilly Leshed, Diego Perez, Jeffrey T. Hancock, Dan...
DCC
2007
IEEE
16 years 28 days ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...
« Prev « First page 1115 / 1260 Last » Next »