Sciweavers

5055 search results - page 349 / 1011
» Relative Timing
Sort
View
MM
2000
ACM
166views Multimedia» more  MM 2000»
15 years 11 months ago
Automatically extracting highlights for TV Baseball programs
In today’s fast-paced world, while the number of channels of television programming available is increasing rapidly, the time available to watch them remains the same or is decr...
Yong Rui, Anoop Gupta, Alex Acero
ERCIMDL
1999
Springer
117views Education» more  ERCIMDL 1999»
15 years 11 months ago
Predicting Indexer Performance in a Distributed Digital Library
Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search e...
Naomi Dushay, James C. French, Carl Lagoze
ALT
1998
Springer
15 years 11 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
HPCA
1996
IEEE
15 years 11 months ago
Register File Design Considerations in Dynamically Scheduled Processors
We have investigated the register file requirements of dynamically scheduled processors using register renaming and dispatch queues running the SPEC92 benchmarks. We looked at pro...
Keith I. Farkas, Norman P. Jouppi, Paul Chow
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 11 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl