Sciweavers

653 search results - page 120 / 131
» Factored Planning: How, When, and When Not
Sort
View
WWW
2004
ACM
16 years 2 months ago
C3W: clipping, connecting and cloning for the web
Many of today's Web applications support just simple trial-anderror retrievals: supply one set of parameters, obtain one set of results. For a user who wants to examine a num...
Aran Lunzer, Jun Fujima, Kasper Hornbæk, Yuz...
WWW
2001
ACM
16 years 2 months ago
Web-based personalization and management of interactive video
This paper describes an application framework for providing and managing personalized, interactive video on the web. The application framework enables content providers and aggreg...
Rune Hjelsvold, Subu Vdaygiri, Yves Léaut&e...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 2 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
175
Voted
SIGMOD
2007
ACM
188views Database» more  SIGMOD 2007»
16 years 2 months ago
Intel Mash Maker: join the web
Intel? Mash Maker is an interactive tool that tracks what the user is doing and tries to infer what information and visualizations they might find useful for their current task. M...
Robert Ennals, Eric A. Brewer, Minos N. Garofalaki...
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 1 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...